scientific article; zbMATH DE number 4119615
From MaRDI portal
zbMATH Open0683.68029MaRDI QIDQ4733397FDOQ4733397
Authors: Gérard Boudol, Ilaria Castellani 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Cited In (37)
- The poset of infinitary traces
- Title not available (Why is that?)
- Event structures for the reversible early internal \(\pi\)-calculus
- Conflict vs causality in event structures
- Models for name-passing processes: Interleaving and causal
- ST-structures
- Concurrent Reversible Sessions
- Reversible sessions with flexible choices
- Concurrent testing of processes
- Self-assembling trees
- Static versus dynamic reversibility in CCS
- Trapping mutual exclusion in the box calculus
- A calculus of branching processes
- Towards a categorical representation of reversible event structures
- A parametric framework for reversible \(\pi\)-calculi
- An event structure semantics for general Petri nets
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- Well-behaved flow event structures for parallel composition and action refinement
- Reduction of event structures under history preserving bisimulation
- Global types and event structure semantics for asynchronous multiparty sessions
- Reversibility and asymmetric conflict in event structures
- The connection between an event structure semantics and an operational semantics for TCSP
- Title not available (Why is that?)
- When is partial trace equivalence adequate?
- Contextual Petri nets, asymmetric event structures, and processes
- Event structure semantics of (controlled) reversible CCS
- Title not available (Why is that?)
- A note on causal trees and their applications to CCS
- Parallel product of event structures
- An algebraic view of interleaving and distributed operational semantics for CCS
- Conditional rewriting logic as a unified model of concurrency
- Minimisation of event structures
- Algebra and theory of order-deterministic pomsets
- Proof-relevant π-calculus: a constructive account of concurrency and causality
- On the implementation of concurrent calculi in net calculi: two case studies
- Observing localities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733397)
