Abstract is missing.
- Partial Order Semantics of Concurrent Programs (Abstract)Eike Best. 1
- SCONE: A Simple Calculus of NetsRoberto Gorrieri, Ugo Montanari. 2-30
- Value-Passing in Process Algebras (Abstract)Matthew Hennessy. 31
- Let s Make Models (Abstract)C. A. R. Hoare. 32
- Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ..Kim Guldstrand Larsen. 33-56
- An Axiomatization of Lamport s Temporal Logic of ActionsMartín Abadi. 57-69
- Convergence of Iteration Systems (Extended Abstract)Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda. 70-82
- Process Algebra with a Zero ObjectJos C. M. Baeten, Jan A. Bergstra. 83-98
- On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on SequencesFrank S. de Boer, Catuscia Palamidessi. 99-114
- Verifying Temporal Properties of ProcessesJulian C. Bradfield, Colin Stirling. 115-125
- Testing Equivalences and Fully Abstract Models for Probabilistic ProcessesIvan Christoff. 126-140
- A Preorder for Partial Process SpecificationsRance Cleaveland, Bernhard Steffen. 141-151
- Back and Forth BisimulationsRocco De Nicola, Ugo Montanari, Frits W. Vaandrager. 152-165
- Reduction and Design of Well-behaved Concurrent SystemsJörg Desel. 166-181
- Synthesis Rules for Petri Nets, and How they Lead to New ResultsJavier Esparza. 182-198
- The Need for Headers: An Impossibility Result for Communication over Unreliable ChannelsAlan Fekete, Nancy A. Lynch. 199-215
- A Temporal Approach to Algebraic SpecificationsYulin Feng, Junbo Liu. 216-229
- Superimposition for Interacting ProcessesNissim Francez, Ira R. Forman. 230-245
- An Implementation of a Translational Semantics for an Imperative LanguageLars-Åke Fredlund, Bengt Jonsson, Joachim Parrow. 246-262
- CCSR: A Calculus for Communicating Shared ResourcesRichard Gerber, Insup Lee. 263-277
- The Linear Time-Branching Time Spectrum (Extended Abstract)Rob J. van Glabbeek. 278-297
- A Programming Logic for Formal Concurent SystemsE. Pascal Gribomont. 298-313
- A New Strategy for Proving omega-Completeness applied to Process AlgebraJan Friso Groote. 314-331
- Transition System Specifications with Negative Premises (Extended Abstract)Jan Friso Groote. 332-341
- Delay-Insensitive Circuits: An Algebraic Approach to their DesignMark B. Josephs, Jan Tijmen Udding. 342-366
- Equivalences, Congruences, and Complete Axiomatizations for Probabilistic ProcessesChi-Chang Jou, Scott A. Smolka. 367-383
- Rewriting as a Unified Model of ConcurrencyJosé Meseguer. 384-400
- A Temporal Calculus of Communicating SystemsFaron Moller, Chris M. N. Tofts. 401-415
- Proving Termination of Communicating ProgramsPawel Paczkowski. 416-426
- Factorization of Finite State Machines under Observational EquivalenceHuajun Qin, Philip Lewis. 427-441
- Partial Order Logics for Elementary Net Systems: State- and Event-approachesAntonia Sinachopoulos. 442-455
- Priority as Extremal ProbabilityScott A. Smolka, Bernhard Steffen. 456-466
- A Synchronous Calculus of Relative FrequencyChris M. N. Tofts. 467-480
- On the Compositional Checking of Validity (Extended Abstract)Glynn Winskel. 481-501
- Real-Time Behaviour of Asynchronous AgentsWang Yi. 502-520
- Effective Solutions to Domain Equations - An Approach to Effective Denotational SemanticsSerge Yoccoz. 521-536