Process algebras for Petri nets. The alphabetization of distributed systems
From MaRDI portal
Publication:2406167
DOI10.1007/978-3-319-55559-1zbMath1377.68002OpenAlexW4247174127MaRDI QIDQ2406167
Publication date: 26 September 2017
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55559-1
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Synthesis and Properties of Optimally Value-Aligned Normative Systems ⋮ Verification of finite-state machines: a distributed approach ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ A Study on Team Bisimulations for BPP Nets ⋮ Process calculi for biological processes ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Team equivalences for finite-state machines with silent moves ⋮ Open Petri nets ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Unnamed Item ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ The Complexity of Synthesis of b-Bounded Petri Nets ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
