13. CONCUR 2002: Brno, Czech Republic

@proceedings{DBLP:conf/concur/2002,
  editor    = {Lubos Brim and
               Petr Jancar and
               Mojm\'{\i}r Kret\'{\i}nsk{\'y} and
               Anton\'{\i}n Kucera},
  title     = {CONCUR 2002 - Concurrency Theory, 13th International Conference,
               Brno, Czech Republic, August 20-23, 2002, Proceedings},
  booktitle = {CONCUR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2421},
  year      = {2002},
  isbn      = {3-540-44043-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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
  Electronic Edition (Springer LINK) BibTeX
• Amir Pnueli, Yonit Kesten:
  A Deductive Proof System for CTL. 24-40
  Electronic Edition (Springer LINK) BibTeX
• Vaughan R. Pratt:
  Event-State Duality: The Enriched Case. 41-56
  Electronic Edition (Springer LINK) BibTeX
• Alexander Moshe Rabinovich:
  Expressive Power of Temporal Logics. 57-75
  Electronic Edition (Springer LINK) BibTeX
• Davide Sangiorgi:
  Types, or: Where's the Difference Between CCS and pi? 76-97
  Electronic Edition (Springer LINK) BibTeX

Invited Tutorials

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

Verification, Model Checking

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

Logic

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

Mobility

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

Probabilistic Systems

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

Models of Computation, Process Algebra

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

Security

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

Petri Nets

• H. C. M. Kleijn, Maciej Koutny:
  Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. 531-546
  Electronic Edition (Springer LINK) BibTeX
• Hagen Völzer:
  Refinement-Robust Fairness. 547-561
  Electronic Edition (Springer LINK) BibTeX

Bisimulation

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