Concurrency and atomicity

DOI10.1016/0304-3975(88)90096-5zbMath0678.68078OpenAlexW1989279866MaRDI QIDQ1124366

Ilaria Castellani, Gérard Boudol

Publication date: 1988

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

Full work available at URL: https://hal.inria.fr/inria-00075804/file/RR-0748.pdf

zbMATH Keywords

operational semanticsPetri netsnondeterminismevent structures``true concurrency

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)

Related Items

Comparing locality and causality based equivalences, Semantic domains of timed event structures, Behavioural characterizations of partial order logics, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Characterising spectra of equivalences for event structures, logically, A general conservative extension theorem in process algebras with inequalities, On relating concurrency and nondeterminism, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, A reduced maximality labeled transition system generation for recursive Petri nets, Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict, A\(^ 2\)CCS: Atomic actions for CCS, A partial ordering semantics for CCS, Petri nets are monoids, Four domains for concurrency, Finitary logics for some CCS observational bisimulations, Universal axioms for bisimulations, Refinement of actions in event structures and causal trees, Atomic actions, and their refinements to isolated protocols, New Bisimulation Semantics for Distributed Systems, Dynamic Causality in Event Structures, On the Expressive Power of Polyadic Synchronisation in π-calculus, Analysis of equivalence relations of event structures with continuous time, A Chart Semantics for the Pi-Calculus, Finite Petri nets as models for recursive causal behaviour

Uses Software

• Esterel

Cites Work

• Algèbre de processus et synchronisation
• A partial ordering semantics for CCS
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• An implementation of mutual inclusion
• Bisimulations and abstraction homomorphisms
• Modeling concurrency with partial orders
• N-free posets as generalizations of series-parallel posets
• Extensional equivalences for transition systems
• Behaviours of concurrent systems
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Testing equivalences for processes
• A structural approach to operational semantics
• Topology of series-parallel networks
• Combinatorial problems of commutation and rearrangements
• The non-sequential behaviour of Petri nets
• Distributed bisimulations
• Guardians and Actions: Linguistic Support for Robust, Distributed Programs
• Concurrent Machines
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• The Recognition of Series Parallel Digraphs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Minimal and Optimal Computations of Recursive Programs
• Maximal chains and antichains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item