Concurrency and atomicity
From MaRDI portal
Publication:1124366
DOI10.1016/0304-3975(88)90096-5zbMATH Open0678.68078OpenAlexW1989279866MaRDI QIDQ1124366FDOQ1124366
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
Cites Work
- Higher-level synchronising devices in Meije-SCCS
- Petri nets, event structures and domains. I
- A structural approach to operational semantics
- Concurrent Machines
- Algebraic laws for nondeterminism and concurrency
- Calculi for synchrony and asynchrony
- Modeling concurrency with partial orders
- A calculus of communicating systems
- Testing equivalences for processes
- The Recognition of Series Parallel Digraphs
- The non-sequential behaviour of Petri nets
- Combinatorial problems of commutation and rearrangements
- A Theory of Communicating Sequential Processes
- Algèbre de processus et synchronisation
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Topology of series-parallel networks
- Extensional equivalences for transition systems
- An implementation of mutual inclusion
- Maximal chains and antichains
- Minimal and Optimal Computations of Recursive Programs
- N-free posets as generalizations of series-parallel posets
- Distributed bisimulations
- A partial ordering semantics for CCS
- Bisimulations and abstraction homomorphisms
- Guardians and Actions: Linguistic Support for Robust, Distributed Programs
- Behaviours of concurrent systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (26)
- Analysis of equivalence relations of event structures with continuous time
- Four domains for concurrency
- A\(^ 2\)CCS: Atomic actions for CCS
- A partial ordering semantics for CCS
- Dynamic Causality in Event Structures
- Finite Petri nets as models for recursive causal behaviour
- Semantic domains of timed event structures
- Petri nets are monoids
- Concurrency: handling interference formally
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict
- Comparing locality and causality based equivalences
- A general conservative extension theorem in process algebras with inequalities
- A reduced maximality labeled transition system generation for recursive Petri nets
- Universal axioms for bisimulations
- Characterising spectra of equivalences for event structures, logically
- On the expressive power of polyadic synchronisation in \(\pi \)-calculus
- Atomic actions, and their refinements to isolated protocols
- Finitary logics for some CCS observational bisimulations
- Behavioural characterizations of partial order logics
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- A chart semantics for the pi-calculus
- Refinement of actions in event structures and causal trees
- On relating concurrency and nondeterminism
- Monitoring Atomicity in Concurrent Programs
- New Bisimulation Semantics for Distributed Systems
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Concurrency in synchronous systems 👍 👎
- Monitoring Atomicity in Concurrent Programs 👍 👎
- Concurrent Programming 👍 👎
- Nebenläufige Programme 👍 👎
- Concurrency and Reversibility 👍 👎
This page was built for publication: Concurrency and atomicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124366)