12. CONCUR 2001: Aalborg, Denmark

Kim Guldstrand Larsen, Mogens Nielsen (Eds.): CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings. Lecture Notes in Computer Science 2154 Springer 2001, ISBN 3-540-42497-0

Invited Talks

Parosh Aziz Abdulla, Bengt Jonsson:
Channel Representations in Protocol Verification. 1-15
Robin Milner:
Bigraphical Reactive Systems. 16-35
Shankar Sastry:
Control of Networks of Unmanned Vehicles. 36
Steve Schneider:
Process Algebra and Security. 37-38

John Hatcliff, Matthew B. Dwyer:
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software. 39-58
Holger Hermanns, Joost-Pieter Katoen:
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. 59-81

Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli:
Typing Mobility in the Seal Calculus. 82-101
Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
Reasoning about Security in Mobile Ambients. 102-120
Dan Hirsch, Ugo Montanari:
Synchronized Hyperedge Replacement with Name Mobility. 121-136
Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. 137-151

Alessandro Aldini:
Probabilistic Information Flow in a Process Algebra. 152-168
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston:
Symbolic Computation of Maximal Probabilistic Reachability. 169-183
Hagen Völzer:
Randomized Non-sequential Processes. 184-201

Antti Puhakka, Antti Valmari:
Liveness and Fairness in Process-Algebraic Verification. 202-217
Keijo Heljanko:
Bounded Reachability Checking with Process Semantics. 218-232
Jaco Geldenhuys, Antti Valmari:
Techniques for Smaller Intermediary BDDs. 233-247
Patricia Bouyer, Antoine Petit, Denis Thérien:
An Algebraic Characterization of Data and Timed Languages. 248-261

Gerald Lüttgen, Walter Vogler:
A Faster-than Relation for Asynchronous Processes. 262-276
Jirí Srba:
On the Power of Labels in Transition Systems. 277-291
Davide Sangiorgi, David Walker:
On Barbed Equivalences in pi-Calculus. 292-304
Iain Phillips:
CCS with Priority Guards. 305-320

Natalia López, Manuel Núñez:
A Testing Theory for Generally Distributed Stochastic Processes. 321-335
Franck van Breugel, James Worrell:
An Algorithm for Quantitative Verification of Probabilistic Transition Systems. 336-350
Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala:
Compositional Methods for Probabilistic Systems. 351-365

Victor Khomenko, Maciej Koutny:
Towards an Efficient Algorithm for Unfolding Petri Nets. 366-380
Paolo Baldan, Andrea Corradini, Barbara König:
A Static Analysis Technique for Graph Transformation Systems. 381-395
Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez:
Local First Search - A New Paradigm for Partial Order Reductions. 396-410
Marcelo Glusman, Shmuel Katz:
Extending Memory Consistency of Finite Prefixes to Infinite Computations. 411-425

Patrice Godefroid, Michael Huth, Radha Jagadeesan:
Abstraction-Based Model Checking Using Modal Transition Systems. 426-440
Marsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh:
Efficient Multiple-Valued Model-Checking Using Lattice Representations. 441-455
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi:
Divide and Compose: SCC Refinement for Language Emptiness. 456-471
Marie Duflot, Laurent Fribourg, Ulf Nilsson:
Unavoidable Configurations of Parameterized Rings of Processes. 472-486

Yifeng Chen, Jeff W. Sanders:
Logic of Global Synchrony. 487-501
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel:
Compositional Modeling of Reactive Systems Using Open Nets. 502-518
Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Extended Temporal Logic Revisited. 519-535

Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar:
Symbolic Algorithms for Infinite-State Games. 536-550
Steve Kremer, Jean-François Raskin:
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. 551-565
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang:
The Control of Synchronous Systems, Part II. 566-582