CONCUR B

38 papers

YearTitle / Authors
1991A Compositional Model for Layered Distributed Systems.
Kenneth J. Goldman
1991A Conditional Operator for CCS.
Juanito Camilleri
1991A Method for the Development of Totally Correct Shared-State Parallel Programs.
Ketil Stølen
1991A Theory of Testing for ACP.
Luca Aceto, Anna Ingólfsdóttir
1991A Tool Set for deciding Behavioral Equivalences.
Jean-Claude Fernandez, Laurent Mounier
1991Abstract Timed Observation and Process Algebra.
Alan Jeffrey
1991Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach.
Wil Janssen, Mannes Poel, Job Zwiers
1991Action and State-based Logics for Process Algebras.
Rocco De Nicola
1991Algebraic Formulations of Trace Theory.
Nicolien J. Drost
1991CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings
Jos C. M. Baeten, Jan Friso Groote
1991Causal Models for Rational Algebraic Processes.
Amar Bouali, Robert de Simone
1991Causality Based Models for the Design of Concurrent Systems.
Ursula Goltz
1991Completeness in Real Time Process Algebra.
Steven Klusener
1991Compositional Synthesis of Live and Bounded Free Choice Petri Nets.
Javier Esparza, Manuel Silva Suárez
1991Distributed CCS.
Padmanabhan Krishnan
1991Efficient Verification of Determinate Processes.
Huajun Quin
1991Embedding as a Tool for Language Comparison: On the CSP Hierarchy.
Frank S. de Boer, Catuscia Palamidessi
1991Experiments on Processes with Backtracking.
Philippe Schnoebelen
1991Extended Horn Clauses: The Framework and Some Semantics.
Jean-Marie Jacquet, Luís Monteiro
1991Fairness in Models with True Concurrency.
Doris Nolte, Lutz Priese
1991Formal Techniques for Parallel Object-Oriented Languages.
Pierre America
1991Geometric Logic, Causality and Event Structures.
Jeremy Gunawardena
1991Invariant Semantics of Nets with Inhibitor Arcs.
Ryszard Janicki, Maciej Koutny
1991Modal Logics for Mobile Processes.
Robin Milner, Joachim Parrow, David Walker
1991Model Checking and Modular Verification.
Orna Grumberg, David E. Long
1991Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract).
Jan Friso Groote, Alban Ponse
1991Real Space Process Algebra.
Jos C. M. Baeten, Jan A. Bergstra
1991Reduced Labelled Transition Systems Save Verification Effort.
Antti Valmari, Matthew Clegg
1991Relating Processes With Respect to Speed.
Faron Moller, Chris M. N. Tofts
1991Simulations Between Specifications of Distributed Systems.
Bengt Jonsson
1991Some Finite-Graph Models for Process Algebra.
Paul Spruit, Roel J. Wieringa
1991Synchrony Loosening Transformations for Interacting Processes.
Nissim Francez, Ira R. Forman
1991Testing, Betting and Timed True Concurrency.
David Murphy
1991The Failure of Failures in a Paradigm for Asynchronous Communication.
Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
1991The Observation Algebra of Spatial Pomsets.
Gian-Luigi Ferrari, Ugo Montanari
1991Time-Constrained Automata (Extended Abstract)
Michael Merritt, Francesmary Modugno, Marc R. Tuttle
1991Towards a Design Calculus for Communicationg Programs.
Ernst-Rüdiger Olderog
1991Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models.
Roope Kaivola, Antti Valmari