Proved trees
From MaRDI portal
Publication:5204353
DOI10.1007/3-540-55719-9_110zbMath1425.68291OpenAlexW2912201013MaRDI QIDQ5204353
Corrado Priami, Pierpaolo Degano
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_110
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (20)
General patterns of interaction in stochastic fusion ⋮ Read-write causality ⋮ Twenty years of rewriting logic ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Replications in reversible concurrent calculi ⋮ From Gene Regulation to Stochastic Fusion ⋮ Extended transition systems for parametric bisimulation ⋮ Distribution and locality of concurrent systems ⋮ Locality and interleaving semantics in calculi for mobile processes ⋮ Location equivalence in a parametric setting ⋮ Causality for mobile processes ⋮ Distributed processes and location failures ⋮ Non-interleaving semantics for mobile processes ⋮ Unnamed Item ⋮ Names of the \(\pi\)-calculus agents handled locally ⋮ Gaining trust by tracing security protocols ⋮ Concurrencies in reversible concurrent calculi ⋮ Language-based performance prediction for distributed and mobile systems ⋮ Dynamic connectors for concurrency ⋮ A causal semantics for CCS via rewriting logic
Cites Work
- Location equivalence in a parametric setting
- Universal axioms for bisimulations
- Algèbre de processus et synchronisation
- A partial ordering semantics for CCS
- Concurrent histories: a basis for observing distributed systems
- A calculus of communicating systems
- A theory of processes with localities
- Process algebra for synchronous communication
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- Branching time and abstraction in bisimulation semantics
- An algebraic view of interleaving and distributed operational semantics for CCS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Proved trees