CONCUR B

37 papers

YearTitle / Authors
1990A New Strategy for Proving omega-Completeness applied to Process Algebra.
Jan Friso Groote
1990A Preorder for Partial Process Specifications.
Rance Cleaveland, Bernhard Steffen
1990A Programming Logic for Formal Concurent Systems.
E. Pascal Gribomont
1990A Synchronous Calculus of Relative Frequency.
Chris M. N. Tofts
1990A Temporal Approach to Algebraic Specifications.
Yulin Feng, Junbo Liu
1990A Temporal Calculus of Communicating Systems.
Faron Moller, Chris M. N. Tofts
1990An Axiomatization of Lamport's Temporal Logic of Actions.
Martín Abadi
1990An Implementation of a Translational Semantics for an Imperative Language.
Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow
1990Back and Forth Bisimulations.
Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager
1990CCSR: A Calculus for Communicating Shared Resources.
Richard Gerber, Insup Lee
1990CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings
Jos C. M. Baeten, Jan Willem Klop
1990Convergence of Iteration Systems (Extended Abstract).
Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda
1990Delay-Insensitive Circuits: An Algebraic Approach to their Design.
Mark B. Josephs, Jan Tijmen Udding
1990Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics.
Serge Yoccoz
1990Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes.
Chi-Chang Jou, Scott A. Smolka
1990Factorization of Finite State Machines under Observational Equivalence.
Huajun Qin, Philip Lewis
1990Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ...
Kim Guldstrand Larsen
1990Let's Make Models (Abstract).
C. A. R. Hoare
1990On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences.
Frank S. de Boer, Catuscia Palamidessi
1990On the Compositional Checking of Validity (Extended Abstract).
Glynn Winskel
1990Partial Order Logics for Elementary Net Systems: State- and Event-approaches.
Antonia Sinachopoulos
1990Partial Order Semantics of Concurrent Programs (Abstract).
Eike Best
1990Priority as Extremal Probability.
Scott A. Smolka, Bernhard Steffen
1990Process Algebra with a Zero Object.
Jos C. M. Baeten, Jan A. Bergstra
1990Proving Termination of Communicating Programs.
Pawel Paczkowski
1990Real-Time Behaviour of Asynchronous Agents.
Wang Yi
1990Reduction and Design of Well-behaved Concurrent Systems.
Jörg Desel
1990Rewriting as a Unified Model of Concurrency.
José Meseguer
1990SCONE: A Simple Calculus of Nets.
Roberto Gorrieri, Ugo Montanari
1990Superimposition for Interacting Processes.
Nissim Francez, Ira R. Forman
1990Synthesis Rules for Petri Nets, and How they Lead to New Results.
Javier Esparza
1990Testing Equivalences and Fully Abstract Models for Probabilistic Processes.
Ivan Christoff
1990The Linear Time-Branching Time Spectrum (Extended Abstract).
Rob J. van Glabbeek
1990The Need for Headers: An Impossibility Result for Communication over Unreliable Channels.
Alan D. Fekete, Nancy A. Lynch
1990Transition System Specifications with Negative Premises (Extended Abstract).
Jan Friso Groote
1990Value-Passing in Process Algebras (Abstract).
Matthew Hennessy
1990Verifying Temporal Properties of Processes.
Julian C. Bradfield, Colin Stirling