Minimal transition systems for history-preserving bisimulation

DOI10.1007/BFb0023477zbMath1498.68190OpenAlexW1490651621MaRDI QIDQ5048942

Marco Pistore, Ugo Montanari

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0023477

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Reduction of event structures under history preserving bisimulation ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Causality versus true-concurrency ⋮ Revisiting causality, coalgebraically ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ Minimisation of event structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observing localities
• CCS expressions, finite state processes, and three problems of equivalence
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Deciding true concurrency equivalences on safe, finite nets
• Concurrent bisimulations in Petri nets
• The non-sequential behaviour of Petri nets
• Three Partition Refinement Algorithms

This page was built for publication: Minimal transition systems for history-preserving bisimulation