Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar2. CONCUR 1991: Amsterdam, The Netherlands
Jos C. M. Baeten, Jan Friso Groote:
CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings. Lecture Notes in Computer Science 527, Springer 1991, ISBN 3-540-54430-5
Invited Lectures
Pierre America:
Formal Techniques for Parallel Object-Oriented Languages. 1-17Amar Bouali, Robert de Simone:
Causal Models for Rational Algebraic Processes. 18-19Rocco De Nicola:
Action and State-based Logics for Process Algebras. 20-22Jean-Claude Fernandez, Laurent Mounier:
A Tool Set for deciding Behavioral Equivalences. 23-42Ursula Goltz:
Causality Based Models for the Design of Concurrent Systems. 43-44Robin Milner, Joachim Parrow, David Walker:
Modal Logics for Mobile Processes. 45-60Ernst-Rüdiger Olderog:
Towards a Design Calculus for Communicationg Programs. 61-77
Selected Presentations
Luca Aceto, Anna Ingólfsdóttir:
A Theory of Testing for ACP. 78-95Jos C. M. Baeten, Jan A. Bergstra:
Real Space Process Algebra. 96-110Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
The Failure of Failures in a Paradigm for Asynchronous Communication. 111-126Frank S. de Boer, Catuscia Palamidessi:
Embedding as a Tool for Language Comparison: On the CSP Hierarchy. 127-141Juanito Camilleri:
A Conditional Operator for CCS. 142-156Nicolien J. Drost:
Algebraic Formulations of Trace Theory. 157-171Javier Esparza, Manuel Silva Suárez:
Compositional Synthesis of Live and Bounded Free Choice Petri Nets. 172-187Gian Luigi Ferrari, Ugo Montanari:
The Observation Algebra of Spatial Pomsets. 188-202Nissim Francez, Ira R. Forman:
Synchrony Loosening Transformations for Interacting Processes. 203-219Kenneth J. Goldman:
A Compositional Model for Layered Distributed Systems. 220-234Jan Friso Groote, Alban Ponse:
Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract). 235-249Orna Grumberg, David E. Long:
Model Checking and Modular Verification. 250-265Jeremy Gunawardena:
Geometric Logic, Causality and Event Structures. 266-280Jean-Marie Jacquet, Luís Monteiro:
Extended Horn Clauses: The Framework and Some Semantics. 281-297Wil Janssen, Mannes Poel, Job Zwiers:
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach. 298-316Ryszard Janicki, Maciej Koutny:
Invariant Semantics of Nets with Inhibitor Arcs. 317-331Alan Jeffrey:
Abstract Timed Observation and Process Algebra. 332-345Bengt Jonsson:
Simulations Between Specifications of Distributed Systems. 346-360Roope Kaivola, Antti Valmari:
Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. 361-375Steven Klusener:
Completeness in Real Time Process Algebra. 376-392Padmanabhan Krishnan:
Distributed CCS. 393-407Michael Merritt, Francesmary Modugno, Marc R. Tuttle:
Time-Constrained Automata (Extended Abstract). 408-423Faron Moller, Chris M. N. Tofts:
Relating Processes With Respect to Speed. 424-438David Murphy:
Testing, Betting and Timed True Concurrency. 439-454Doris Nolte, Lutz Priese:
Fairness in Models with True Concurrency. 455-469Huajun Quin:
Efficient Verification of Determinate Processes. 470-479Philippe Schnoebelen:
Experiments on Processes with Backtracking. 480-494Paul Spruit, Roel J. Wieringa:
Some Finite-Graph Models for Process Algebra. 495-509Ketil Stølen:
A Method for the Development of Totally Correct Shared-State Parallel Programs. 510-525Antti Valmari, Matthew Clegg:
Reduced Labelled Transition Systems Save Verification Effort. 526-540
last updated on 2019-09-22 22:03 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
