CONCUR B

35 papers

YearTitle / Authors
2006A Capability Calculus for Concurrency and Determinism.
Tachio Terauchi, Alex Aiken
2006A Complete Axiomatic Semantics for the CSP Stable-Failures Model.
Yoshinao Isobe, Markus Roggenbach
2006A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification.
Suzana Andova, Jos C. M. Baeten, Tim A. C. Willemse
2006A Language for Task Orchestration and Its Semantic Properties.
David Kitchin, William R. Cook, Jayadev Misra
2006A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems.
Stefan Leue, Alin Stefanescu, Wei Wei
2006A New Type System for Deadlock-Free Processes.
Naoki Kobayashi
2006CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings
Christel Baier, Holger Hermanns
2006Checking a Mutex Algorithm in a Process Algebra with Fairness.
Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2006Concurrent Rewriting for Graphs with Equivalences.
Paolo Baldan, Fabio Gadducci, Ugo Montanari
2006Controller Synthesis for MTL Specifications.
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
2006Dynamic Access Control in a Concurrent Object Calculus.
Avik Chaudhuri
2006Encoding CDuce in the Cpi-Calculus.
Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Daniele Varacca
2006Event Structure Semantics for Nominal Calculi.
Roberto Bruni, Hernán C. Melgratti, Ugo Montanari
2006Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words.
Orna Kupferman, Sarai Sheinvald-Faragy
2006Generic Forward and Backward Simulations.
Ichiro Hasuo
2006Inference of Event-Recording Automata Using Timed Decision Trees.
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
2006Liveness, Fairness and Impossible Futures.
Rob J. van Glabbeek, Marc Voorhoeve
2006Minimization, Learning, and Conformance Testing of Boolean Programs.
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
2006Model Checking Quantified Computation Tree Logic.
Arend Rensink
2006Modeling Timed Concurrent Systems.
Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee
2006On Finite Alphabets and Infinite Bases III: Simulation.
Taolue Chen, Wan J. Fokkink
2006On Interleaving in Timed Automata.
Ramzi Ben Salah, Marius Bozga, Oded Maler
2006Operational Determinism and Fast Algorithms.
Henri Hansen, Antti Valmari
2006Probabilistic I/O Automata: Theories of Two Equivalences.
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
2006Probability and Nondeterminism in Operational Models of Concurrency.
Roberto Segala
2006Proving Liveness by Backwards Reachability.
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
2006Reachability in Recursive Markov Decision Processes.
Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera
2006Sanity Checks in Formal Verification.
Orna Kupferman
2006Second-Order Simple Grammars.
Colin Stirling
2006Some Remarks on Definability of Process Graphs.
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
2006Sortings for Reactive Systems.
Lars Birkedal, Søren Debois, Thomas T. Hildebrandt
2006Strategy Improvement for Stochastic Rabin and Streett Games.
Krishnendu Chatterjee, Thomas A. Henzinger
2006Transition Systems of Elementary Net Systems with Localities.
Maciej Koutny, Marta Pietkiewicz-Koutny
2006Weak Bisimulation Up to Elaboration.
Damien Pous
2006Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi.
Uwe Nestmann