default search action
17th CONCUR 2006: Bonn, Germany
- Christel Baier, Holger Hermanns
:
CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings. Lecture Notes in Computer Science 4137, Springer 2006, ISBN 3-540-37376-4
Invited Contributions
- Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Lee:
Modeling Timed Concurrent Systems. 1-15 - Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Some Remarks on Definability of Process Graphs. 16-36 - Orna Kupferman:
Sanity Checks in Formal Verification. 37-51
Invited Tutorials
- Uwe Nestmann:
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi. 52-63 - Roberto Segala:
Probability and Nondeterminism in Operational Models of Concurrency. 64-78
Model Check
- Stefan Leue, Alin Stefanescu, Wei Wei:
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems. 79-94 - Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena:
Proving Liveness by Backwards Reachability. 95-109 - Arend Rensink:
Model Checking Quantified Computation Tree Logic. 110-125
Process Calculi
- Rob J. van Glabbeek, Marc Voorhoeve:
Liveness, Fairness and Impossible Futures. 126-141 - Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Checking a Mutex Algorithm in a Process Algebra with Fairness. 142-157 - Yoshinao Isobe, Markus Roggenbach
A Complete Axiomatic Semantics for the CSP Stable-Failures Model. 158-172 - Maciej Koutny, Marta Pietkiewicz-Koutny:
Transition Systems of Elementary Net Systems with Localities. 173-187
Minimization and Equivalence Checking
- Henri Hansen, Antti Valmari:
Operational Determinism and Fast Algorithms. 188-202 - Viraj Kumar
Minimization, Learning, and Conformance Testing of Boolean Programs. 203-217 - Tachio Terauchi
A Capability Calculus for Concurrency and Determinism. 218-232
Types
- Naoki Kobayashi
A New Type System for Deadlock-Free Processes. 233-247 - Lars Birkedal, Søren Debois, Thomas T. Hildebrandt:
Sortings for Reactive Systems. 248-262 - Avik Chaudhuri:
Dynamic Access Control in a Concurrent Object Calculus. 263-278
Semantics
- Paolo Baldan, Fabio Gadducci, Ugo Montanari:
Concurrent Rewriting for Graphs with Equivalences. 279-294 - Roberto Bruni, Hernán C. Melgratti, Ugo Montanari:
Event Structure Semantics for Nominal Calculi. 295-309 - Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Daniele Varacca:
Encoding CDuce in the Cpi-Calculus. 310-326
Probability
- Suzana Andova, Jos C. M. Baeten, Tim A. C. Willemse:
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification. 327-342 - Eugene W. Stark, Rance Cleaveland, Scott A. Smolka:
Probabilistic I/O Automata: Theories of Two Equivalences. 343-357 - Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Reachability in Recursive Markov Decision Processes. 358-374 - Krishnendu Chatterjee, Thomas A. Henzinger:
Strategy Improvement for Stochastic Rabin and Streett Games. 375-389
Bisimulation and Simulation
- Damien Pous
Weak Bisimulation Up to Elaboration. 390-405 - Ichiro Hasuo:
Generic Forward and Backward Simulations. 406-420 - Taolue Chen
On Finite Alphabets and Infinite Bases III: Simulation. 421-434
Real Time
- Olga Grinchtein, Bengt Jonsson, Paul Pettersson:
Inference of Event-Recording Automata Using Timed Decision Trees. 435-449 - Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier:
Controller Synthesis for MTL Specifications. 450-464 - Ramzi Ben Salah, Marius Bozga, Oded Maler:
On Interleaving in Timed Automata. 465-476
Formal Languages
- David Kitchin, William R. Cook, Jayadev Misra:
A Language for Task Orchestration and Its Semantic Properties. 477-491 - Orna Kupferman, Sarai Sheinvald-Faragy:
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words. 492-508 - Colin Stirling:
Second-Order Simple Grammars. 509-523
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-12 21:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: