Models for concurrency: Towards a classification

DOI10.1016/S0304-3975(96)80710-9zbMath0874.68120OpenAlexW4210671891MaRDI QIDQ672053

Mogens Nielsen, Glynn Winskel, Vladimiro Sassone

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)80710-9

zbMATH Keywords

categorybehaviour/systemclassification of models for concurrencyinterleaving/noninterleavinglinear/branching time

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Clustering for Petri nets, EMSO-logic and automata related to homogeneous flow event structures, Semantic domains of timed event structures, Configuration structures, event structures and Petri nets, Refinement preserving approximations for the design and verification of heterogeneous systems, Languages of higher-dimensional automata, Models for name-passing processes: Interleaving and causal, The true concurrency of differential interaction nets, Timing and causality in process algebra, Approximating Behaviors in Embedded System Design, The correctness of concurrencies in (reversible) concurrent calculi, Independence Abstractions and Models of Concurrency, Untanglings: a novel approach to analyzing concurrent systems, An axiomatic approach to reversible computation, Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict, Domain theory for concurrency, From domains to automata with concurrency, Cathoristic Logic, On the Origin of Events: Branching Cells as Stubborn Sets, Partial-order Boolean games: informational independence in a logic-based model of strategic interaction, The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems, Model-checking games for fixpoint logics with partial order models, Unnamed Item, Unnamed Item, Rule-based and object-based event structures for membrane systems, Branching time controllers for discrete event systems, Contracts for BIP: Hierarchical Interaction Models for Compositional Verification, Concurrent semantics for fusions: weak prime domains and connected event structures, True Concurrency of Deep Inference Proofs, Representation of computations in concurrent automata by dependence orders, Synchronization expressions with extended join operation, Constructing weak simulations from linear implications for processes with private names, On linear logic planning and concurrency, Processes against tests: on defining contextual equivalences, Concurrencies in reversible concurrent calculi, Synchronization languages and rewriting systems, Reversibility and Models for Concurrency, Directed Homotopy in Non-Positively Curved Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent transition systems
• Petri nets, event structures and domains. I
• Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/September 1993. Proceedings
• Synchronization trees
• A structural approach to operational semantics
• Concurrent Machines
• CONCURRENT AUTOMATA AND DOMAINS
• Formal verification of parallel programs
• On relating some models for concurrency