default search action
4th CONCUR 1993: Hildesheim, Germany
- Eike Best:
CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings. Lecture Notes in Computer Science 715, Springer 1993, ISBN 3-540-57208-2 - Gérard Boudol:
The Lambda-Calculus with Multiplicities (Abstract). 1-6 - Joost Engelfriet:
A Multiset Semantics for the pi-Calculus with Replication. 7-21 - Mads Dam:
Model Checking Mobile Processes. 22-36 - Glenn Bruns:
A Practical Technique for Process Abstraction. 37-49 - Maarten M. Fokkinga, Mannes Poel, Job Zwiers:
Modular Completeness for Communication Closed Layers. 50-65 - Rob J. van Glabbeek:
The Linear Time - Branching Time Spectrum II. 66-81 - Vladimiro Sassone, Mogens Nielsen, Glynn Winskel:
A Classification of Models for Concurrency. 82-96 - Luca Aceto, David Murphy:
On the Ill-Timed but Well-Caused. 97-111 - Roberto M. Amadio:
On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation. 112-126 - Davide Sangiorgi:
A Theory of Bisimulation for the pi-Calculus. 127-142 - Søren Christensen, Yoram Hirshfeld, Faron Moller
:
Bisimulation Equivalence is Decidable for Basic Parallel Processes. 143-157 - Cliff B. Jones
A pi-Calculus Semantics for an Object-Based Design Notation. 158-172 - K. V. S. Prasad:
Programming with Broadcasts. 173-187 - Uno Holmer:
Interpreting Broadcast Communication in SCCS. 188-201 - Matthew Hennessy, Huimin Lin:
Proof Systems for Message-Passing Process Algebras. 202-216 - Michael J. Butler:
Refinement and Decomposition of Value-Passing Action Systems. 217-232 - Pierre Wolper
Partial-Order Methods for Temporal Verification. 233-246 - Ole Høgh Jensen, Jarl Tuxen Lang, Christian Jeppesen, Kim Guldstrand Larsen:
Model Construction for Implicit Specifications in Model Logic. 247-261 - Orna Bernholtz, Orna Grumberg:
Branching Time Temporal Logic and Amorphous Tree Automata. 262-277 - Jeremy Gunawardena:
A Generalized Event Structure for the Muller Unfolding of a Safe Net. 278-292 - Eric Goubault:
Domains of Higher-Dimensional Automata. 293-307 - Jos C. M. Baeten, Jan A. Bergstra:
Non Interleaving Process Algebra. 308-323 - Roberto Segala:
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract). 324-338 - Rob T. Udink, Joost N. Kok:
Two Fully Abstract Models for UNITY. 339-352 - Shengzong Zhou, Rob Gerth, Ruurd Kuiper:
Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems (Extended Abstract). 353-367 - Marija Cubric, Prakash Panangaden:
Minimal Memory Schedules for Dataflow Networks. 368-383 - Robert Kim Yates:
Networks of Real-Time Processes. 384-397 - Christian Lengauer:
Loop Parallelization in the Polytope Model. 398-416 - Patrice Brémond-Grégoire, Insup Lee, Richard Gerber:
ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities. 417-431 - Wan J. Fokkink:
An Elimination Theorem for Regular Behaviours with Integration. 432-446 - Bart Vergauwen, Johan Lewi:
A Linear Local Model Checking Algorithm for CTL. 447-461 - P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan:
Local Event Structures and Petri Nets. 462-476 - Jos C. M. Baeten, Chris Verhoef:
A Congruence Theorem for Structured Operational Semantics with Predicates. 477-492 - Flemming Nielson, Hanne Riis Nielson:
From CML to Process Algebras (Extended Abstract). 493-508 - Kohei Honda:
Types for Dyadic Interaction. 509-523 - Vasco Thudichum Vasconcelos, Kohei Honda:
Principal Typing Schemes in a Polyadic pi-Calculus. 524-538 - Bard Bloom:
Structured Operational Sematics for Process Algebras and Equational Axiom Systems. 539-540
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-28 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: