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