Abstract is missing.
- Lokal Model Checking GamesColin Stirling. 1-11
- Compositional Proof Systems for Model Checking Infinite State ProcessesMads Dam. 12-26
- Compositional Model Checking of Real Time SystemsFrançois Laroussinie, Kim Guldstrand Larsen. 27-41
- Checking Bisimilarity for Finitary pi-CalculusUgo Montanari, Marco Pistore. 42-56
- The Weak Late pi-Calculus Semantics as Observation EquivalenceGian Luigi Ferrari, Ugo Montanari, Paola Quaglia. 57-71
- The Fixpoint-Analysis MachineBernhard Steffen, Andreas Claßen, Marion Klein, Jens Knoop, Tiziana Margaria. 72-87
- Unique Fixpoint Induction for Mobile ProcessesH. Lin. 88-102
- A Polymorphic Type System for the Polyadic pi-calculusXinxin Liu, David Walker. 103-116
- Fibrational Control StructuresClaudio Hermida, John Power. 117-129
- Fully Abstract Models for Nondeterministic Regular ExpressionsFlavio Corradini, Rocco De Nicola, Anna Labella. 130-144
- A Petri Net Semantics for pi-CalculusNadia Busi, Roberto Gorrieri. 145-159
- A Complete Theory of Deterministic Event StructuresArend Rensink. 160-174
- Characterizing Behavioural Congruences for Petri NetsMogens Nielsen, Lutz Priese, Vladimiro Sassone. 175-189
- Verification of a Distributed Summation AlgorithmFrits W. Vaandrager. 190-203
- Confluence for Process VerificationJan Friso Groote, M. P. A. Sellink. 204-218
- Axiomatisations of Weak Equivalences for De Simone LanguagesIrek Ulidowski. 219-233
- A Compositional Trace-Based Semantics for Probabilistic AutomataRoberto Segala. 234-248
- Acceptance Trees for Probabilistic ProcessesManuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz. 249-263
- Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems EngineeringDavid Harel. 264-268
- Towards a denotational semantics for ET-LOTOSJeremy Bryans, Jim Davies, Steve Schneider. 269-283
- Reachability Analysis at Procedure Level through Timing CoincidenceFarn Wang. 284-298
- Faster Asynchronous SystemsWalter Vogler. 299-312
- Fair TestingEd Brinksma, Arend Rensink, Walter Vogler. 313-327
- Formal Methods Technology Transfer: Impediments and Innovation (Abstract)Dan Craigen. 328-332
- Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract)Parosh Aziz Abdulla, Mats Kindahl. 333-347
- Checking Regular Properties of Petri NetsPetr Jancar, Faron Moller. 348-362
- Metric Predicate Transformers: Towards a Notion of Refinement for ConcurrencyMarcello M. Bonsangue, Joost N. Kok, Erik P. de Vink. 363-377
- A Refinement Theory that Supports both Decrease of Nondeterminism and Increase of Parallelism Michael Siegel. 378-392
- Efficient Automation of Temporal ReasoningE. Allen Emerson. 393-394
- Veryfying Parameterized Networks using Abstraction and Regular LanguagesEdmund M. Clarke, Orna Grumberg, Somesh Jha. 395-407
- On the Complexity of Branching Modular Model Checking (Extended Abstract)Orna Kupferman, Moshe Y. Vardi. 408-422
- Axiomatising Linear Time Mu-calculusRoope Kaivola. 423-437
- A Trace Consistent Subset of PTLP. S. Thiagarajan. 438-452
- Tutorial: Proving Properties of Concurrent System with SPINGerard J. Holzmann. 453-455
- On Sharing and Determinacy in Concurrent SystemsAnna Philippou, David Walker. 456-470
- Process Semantics of Graph ReductionSimon Brock, Gerald Ostheimer. 471-485
- Bisimulations for a Calculus of Broadcasting SystemsMatthew Hennessy, Julian Rathke. 486-500
- Delayed choice for process algebra with abstractionPedro R. D Argenio, Sjouke Mauw. 501-515
- CTR: A Calculus of Timed RefinementKarlis Cerans. 516-530
- Temporal Logic + Timed Automata: Expressiveness and DecidabilityAhmed Bouajjani, Yassine Lakhnech. 531-545