Abstract is missing.
- The Polyadic Pi-calculus (Abstract)Robin Milner. 1
- Testing Equivalence for Mobile Processes (Extended Abstract)Michele Boreale, Rocco De Nicola. 2-16
- Testing Equivalence for Petri Nets with Action Refinement: Preliminary ReportLalita Jategaonkar, Albert R. Meyer. 17-31
- The Problem of Weak Bisimulation up to Davide Sangiorgi, Robin Milner. 32-46
- On the Uniqueness of Fixpoints Modulo Observation CongruenceEd Brinksma. 47-61
- Verification of Parallel Systems via DecompositionJan Friso Groote, Faron Moller. 62-76
- Interface Refinement in Reactive Systems (Extended Abstract)Rob Gerth, Ruurd Kuiper, John Segers. 77-93
- Concurrent Testing of Processes (Extended Abstract)Matthew Hennessy. 94-107
- A Theory of Process with Localities (Extended Abstract)Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn. 108-122
- Model Checking for Context-Free ProcessesOlaf Burkart, Bernhard Steffen. 123-137
- Bisimulation Equivalence is Decidable for all Context-Free ProcessesSøren Christensen, Hans Hüttel, Colin Stirling. 138-147
- Distributed Bisimularity is Decidable for a Class of Infinite State-Space SystemsSøren Christensen. 148-161
- How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract)Amir Pnueli. 162-175
- Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version)Frank A. Stomp. 176-191
- Sometimes Some is as Good as All Doron Peled. 192-206
- The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal LogicRoope Kaivola, Antti Valmari. 207-221
- Propositional Temporal Logics and EquivalencesUrsula Goltz, Ruurd Kuiper, Wojciech Penczek. 222-236
- The Duality of TIme and InformationVaughan R. Pratt. 237-253
- Homology of Higher Dimensional AutomataEric Goubault, Thomas P. Jensen. 254-268
- Posets for Configurations!Arend Rensink. 269-285
- On the Semantics of Petri NetsJosé Meseguer, Ugo Montanari, Vladimiro Sassone. 286-301
- Structural Operational Specifications and the Trace AutomataEric Badouel, Philippe Darondeau. 302-316
- At-Most-Once Message Delivery. A Case Study in Algorithm VerificationButler W. Lampson, Nancy A. Lynch, Jørgen F. Søgaard-Andersen. 317-324
- Games I/O Automata Play (Extended Abstract)Nick Reingold, Da-Wei Wang, Lenore D. Zuck. 325-339
- Minimization of Timed Transition SystemsRajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, David L. Dill, Howard Wong-Toi. 340-354
- Using CSP to Verify a Timed Protocol over a Fair MediumJim Davies, Steve Schneider. 355-369
- Timed Ethernet: Real-Time Formal Specification of EthernetHenri B. Weinberg, Lenore D. Zuck. 370-385
- Implementing LOTOS Specifications by Communicating State MachinesGünter Karjoth. 386-400
- Discrete Time Process AlgebraJos C. M. Baeten, Jan A. Bergstra. 401-420
- The Silent Step in TimeSteven Klusener. 421-435
- Action Transducers and Timed AutomataFrits W. Vaandrager, Nancy A. Lynch. 436-455
- Compositional Verification of Probabilistic ProcessesKim Guldstrand Larsen, Arne Skou. 456-471
- Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract)Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka. 472-485
- Embeddings Among Concurrent Programming Languages (Preliminary Version)Ehud Y. Shapiro. 486-503
- Logic of Trace Languages (Extended Abstract)Alexander Moshe Rabinovich. 504-517
- Multiway Synchrinizaton Verified with Coupled SimulationJoachim Parrow, Peter Sjödin. 518-533
- Programming in a General Model of SynchronizationSteven M. German. 534-549
- Operational and Compositional Semantics of Synchronous Automaton CompositionsFlorence Maraninchi. 550-564
- Towards a Theory of Actor ComputationGul Agha, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott. 565-579