Abstract is missing.
- Modeling Timed Concurrent SystemsXiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee. 1-15 [doi]
- Some Remarks on Definability of Process GraphsClemens Grabmayer, Jan Willem Klop, Bas Luttik. 16-36 [doi]
- Sanity Checks in Formal VerificationOrna Kupferman. 37-51 [doi]
- Welcome to the Jungle: A Subjective Guide to Mobile Process CalculiUwe Nestmann. 52-63 [doi]
- Probability and Nondeterminism in Operational Models of ConcurrencyRoberto Segala. 64-78 [doi]
- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive SystemsStefan Leue, Alin Stefanescu, Wei Wei. 79-94 [doi]
- Proving Liveness by Backwards ReachabilityParosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena. 95-109 [doi]
- Model Checking Quantified Computation Tree LogicArend Rensink. 110-125 [doi]
- Liveness, Fairness and Impossible FuturesRob J. van Glabbeek, Marc Voorhoeve. 126-141 [doi]
- Checking a Mutex Algorithm in a Process Algebra with FairnessFlavio Corradini, Maria Rita Di Berardini, Walter Vogler. 142-157 [doi]
- A Complete Axiomatic Semantics for the CSP Stable-Failures ModelYoshinao Isobe, Markus Roggenbach. 158-172 [doi]
- Transition Systems of Elementary Net Systems with LocalitiesMaciej Koutny, Marta Pietkiewicz-Koutny. 173-187 [doi]
- Operational Determinism and Fast AlgorithmsHenri Hansen, Antti Valmari. 188-202 [doi]
- Minimization, Learning, and Conformance Testing of Boolean ProgramsViraj Kumar, P. Madhusudan, Mahesh Viswanathan. 203-217 [doi]
- A Capability Calculus for Concurrency and DeterminismTachio Terauchi, Alex Aiken. 218-232 [doi]
- A New Type System for Deadlock-Free ProcessesNaoki Kobayashi. 233-247 [doi]
- Sortings for Reactive SystemsLars Birkedal, Søren Debois, Thomas T. Hildebrandt. 248-262 [doi]
- Dynamic Access Control in a Concurrent Object CalculusAvik Chaudhuri. 263-278 [doi]
- Concurrent Rewriting for Graphs with EquivalencesPaolo Baldan, Fabio Gadducci, Ugo Montanari. 279-294 [doi]
- Event Structure Semantics for Nominal CalculiRoberto Bruni, Hernán C. Melgratti, Ugo Montanari. 295-309 [doi]
- Encoding CDuce in the Cpi-CalculusGiuseppe Castagna, Mariangiola Dezani-Ciancaglini, Daniele Varacca. 310-326 [doi]
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol VerificationSuzana Andova, Jos C. M. Baeten, Tim A. C. Willemse. 327-342 [doi]
- Probabilistic I/O Automata: Theories of Two EquivalencesEugene W. Stark, Rance Cleaveland, Scott A. Smolka. 343-357 [doi]
- Reachability in Recursive Markov Decision ProcessesTomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera. 358-374 [doi]
- Strategy Improvement for Stochastic Rabin and Streett GamesKrishnendu Chatterjee, Thomas A. Henzinger. 375-389 [doi]
- Weak Bisimulation Up to ElaborationDamien Pous. 390-405 [doi]
- Generic Forward and Backward SimulationsIchiro Hasuo. 406-420 [doi]
- On Finite Alphabets and Infinite Bases III: SimulationTaolue Chen, Wan Fokkink. 421-434 [doi]
- Inference of Event-Recording Automata Using Timed Decision TreesOlga Grinchtein, Bengt Jonsson, Paul Pettersson. 435-449 [doi]
- Controller Synthesis for MTL SpecificationsPatricia Bouyer, Laura Bozzelli, Fabrice Chevalier. 450-464 [doi]
- On Interleaving in Timed AutomataRamzi Ben Salah, Marius Bozga, Oded Maler. 465-476 [doi]
- A Language for Task Orchestration and Its Semantic PropertiesDavid Kitchin, William R. Cook, Jayadev Misra. 477-491 [doi]
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite WordsOrna Kupferman, Sarai Sheinvald-Faragy. 492-508 [doi]
- Second-Order Simple GrammarsColin Stirling. 509-523 [doi]