13. CONCUR 2002: Brno, Czech Republic

Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera (Eds.): CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Lecture Notes in Computer Science 2421 Springer 2002, ISBN 3-540-44043-7

Invited Talks

Wan Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein:
Refinement and Verification Applied to an In-Flight Data Acquisition Unit. 1-23
Amir Pnueli, Yonit Kesten:
A Deductive Proof System for CTL. 24-40
Vaughan R. Pratt:
Event-State Duality: The Enriched Case. 41-56
Alexander Moshe Rabinovich:
Expressive Power of Temporal Logics. 57-75
Davide Sangiorgi:
Types, or: Where's the Difference Between CCS and pi? 76-97

Julian C. Bradfield:
Introduction to Modal and Temporal Mu-Calculi (Abstract). 98
Andrew D. Gordon:
Types for Cryptographic Protocols. 99-100

Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck:
Network Invariants in Action. 101-115
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso:
Regular Model Checking Made Simple and Efficient. 116-130
Kousha Etessami:
A Hierarchy of Polynomial-Time Computable Simulations for Automata. 131-144
P. Madhusudan, P. S. Thiagarajan:
A Decidable Class of Asynchronous Distributed Controllers. 145-160
Antti Valmari, Antti Kervinen:
Alphabet-Based Synchronisation is Exponentially Cheaper. 161-176
Markus Lohrey:
Safe Realizability of High-Level Message Sequence Charts. 177-192
Eugene Asarin, Gerardo Schneider:
Widening the Boundary between Decidable and Undecidable Hybrid Systems. 193-208

Luís Caires, Luca Cardelli:
A Spatial Logic for Concurrency (Part II). 209-225
Beata Konikowska, Wojciech Penczek:
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. 226-239
Martin Lange:
Local Model Checking Games for Fixed Point Logic with Chop. 240-254
Maria Sorea:
A Decidable Fixpoint Logic for Time-Outs. 255-271

Jens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone:
A Calculus of Mobile Resources. 272-287
David Teller, Pascal Zimmer, Daniel Hirschkoff:
Using Ambients to Control Resources. 288-303
Massimo Merro, Vladimiro Sassone:
Typing and Subtyping Mobility in Boxed Ambients. 304-320
Roberto Bruni, Cosimo Laneve, Ugo Montanari:
Orchestrating Transactions in Join Calculus. 321-337

Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort:
Simulation for Continuous-Time Markov Chains. 338-354
Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Weak Bisimulation is Sound and Complete for PCTL*. 355-370
Stefano Cattani, Roberto Segala:
Decision Algorithms for Probabilistic Bisimulation. 371-385

Gerald Lüttgen, Michael Mendler:
Axiomatizing an Algebra of Step Reactions for Synchronous Languages. 386-401
Jean Fanchon, Rémi Morin:
Regular Sets of Pomsets with Autoconcurrency. 402-417
Philippa Gardner, Cosimo Laneve, Lucian Wischik:
The Fusion Machine. 418-433
Mikkel Nygaard, Glynn Winskel:
HOPLA-A Higher-Order Process Language. 434-448
Maria Grazia Buscemi, Ugo Montanari:
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence. 449-465
Stephen D. Brookes:
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. 466-482

Michele Boreale, Maria Grazia Buscemi:
A Framework for the Analysis of Security Protocols. 483-498
Roberto M. Amadio, Witold Charatonik:
On Name Generation and Set-Based Analysis in the Dolev-Yao Model. 499-514
Ralf Küsters:
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. 515-530

H. C. M. Kleijn, Maciej Koutny:
Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. 531-546
Hagen Völzer:
Refinement-Robust Fairness. 547-561

Slawomir Lasota:
Decidability of Strong Bisimilarity for Timed BPP. 562-578
Jirí Srba:
Undecidability of Weak Bisimilarity for Pushdown Processes. 579-593
Antonín Kucera, Richard Mayr:
Why Is Simulation Harder than Bisimulation? 594-610