4. CONCUR 1993: Hildesheim, Germany

Eike Best (Ed.): 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 BibTeX

@proceedings{DBLP:conf/concur/1993,
  editor    = {Eike Best},
  title     = {CONCUR '93, 4th International Conference on Concurrency Theory,
               Hildesheim, Germany, August 23-26, 1993, Proceedings},
  booktitle = {CONCUR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {715},
  year      = {1993},
  isbn      = {3-540-57208-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Gérard Boudol: The Lambda-Calculus with Multiplicities (Abstract). 1-6 BibTeX
Joost Engelfriet: A Multiset Semantics for the pi-Calculus with Replication. 7-21 BibTeX
Mads Dam: Model Checking Mobile Processes. 22-36 BibTeX
Glenn Bruns: A Practical Technique for Process Abstraction. 37-49 BibTeX
Maarten M. Fokkinga, Mannes Poel, Job Zwiers: Modular Completeness for Communication Closed Layers. 50-65 BibTeX
Rob J. van Glabbeek: The Linear Time - Branching Time Spectrum II. 66-81 BibTeX
Vladimiro Sassone, Mogens Nielsen, Glynn Winskel: A Classification of Models for Concurrency. 82-96 BibTeX
Luca Aceto, David Murphy: On the Ill-Timed but Well-Caused. 97-111 BibTeX
Roberto M. Amadio: On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation. 112-126 BibTeX
Davide Sangiorgi: A Theory of Bisimulation for the pi-Calculus. 127-142 BibTeX
Søren Christensen, Yoram Hirshfeld, Faron Moller: Bisimulation Equivalence is Decidable for Basic Parallel Processes. 143-157 BibTeX
Cliff B. Jones: A pi-Calculus Semantics for an Object-Based Design Notation. 158-172 BibTeX
K. V. S. Prasad: Programming with Broadcasts. 173-187 BibTeX
Uno Holmer: Interpreting Broadcast Communication in SCCS. 188-201 BibTeX
Matthew Hennessy, H. Lin: Proof Systems for Message-Passing Process Algebras. 202-216 BibTeX
Michael J. Butler: Refinement and Decomposition of Value-Passing Action Systems. 217-232 BibTeX
Pierre Wolper, Patrice Godefroid: Partial-Order Methods for Temporal Verification. 233-246 BibTeX
Ole Høgh Jensen, Jarl Tuxen Lang, Christian Jeppesen, Kim Guldstrand Larsen: Model Construction for Implicit Specifications in Model Logic. 247-261 BibTeX
Orna Bernholtz, Orna Grumberg: Branching Time Temporal Logic and Amorphous Tree Automata. 262-277 BibTeX
Jeremy Gunawardena: A Generalized Event Structure for the Muller Unfolding of a Safe Net. 278-292 BibTeX
Eric Goubault: Domains of Higher-Dimensional Automata. 293-307 BibTeX
Jos C. M. Baeten, Jan A. Bergstra: Non Interleaving Process Algebra. 308-323 BibTeX
Roberto Segala: Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract). 324-338 BibTeX
Rob T. Udink, Joost N. Kok: Two Fully Abstract Models for UNITY. 339-352 BibTeX
Shengzong Zhou, Rob Gerth, Ruurd Kuiper: Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems (Extended Abstract). 353-367 BibTeX
Marija Cubric, Prakash Panangaden: Minimal Memory Schedules for Dataflow Networks. 368-383 BibTeX
Robert Kim Yates: Networks of Real-Time Processes. 384-397 BibTeX
Christian Lengauer: Loop Parallelization in the Polytope Model. 398-416 BibTeX
Patrice Brémond-Grégoire, Insup Lee, Richard Gerber: ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities. 417-431 BibTeX
Wan Fokkink: An Elimination Theorem for Regular Behaviours with Integration. 432-446 BibTeX
Bart Vergauwen, Johan Lewi: A Linear Local Model Checking Algorithm for CTL. 447-461 BibTeX
P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan: Local Event Structures and Petri Nets. 462-476 BibTeX
Jos C. M. Baeten, Chris Verhoef: A Congruence Theorem for Structured Operational Semantics with Predicates. 477-492 BibTeX
Flemming Nielson, Hanne Riis Nielson: From CML to Process Algebras (Extended Abstract). 493-508 BibTeX
Kohei Honda: Types for Dynamic Interaction. 509-523 BibTeX
Vasco Thudichum Vasconcelos, Kohei Honda: Principal Typing Schemes in a Polyadic pi-Calculus. 524-538 BibTeX
Bard Bloom: Structured Operational Sematics for Process Algebras and Equational Axiom Systems. 539-540 BibTeX