Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

DOI10.46298/lmcs-19(4:37)2023arXiv2104.14856OpenAlexW3158514776MaRDI QIDQ6137873

Roberto Gorrieri, Unnamed Author

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.14856

zbMATH Keywords

decidabilitytrue concurrencybehavioral equivalencescausal-net bisimilarityfully-concurrent bisimilarityi-causal-net bisimilarity

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidability of bisimilarity for Petri nets and some related problems
• A coalgebraic semantics for causality in Petri nets
• Petri nets are monoids
• Sequential and concurrent behaviour in Petri net theory
• Concurrent systems and inevitability
• Branching processes of Petri nets
• Deciding true concurrency equivalences on safe, finite nets
• Generalized OM-bisimulation
• A study on team bisimulation and H-team bisimulation for BPP nets
• Revisiting causality, coalgebraically
• Concurrent bisimulations in Petri nets
• The non-sequential behaviour of Petri nets
• Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
• Nets, Terms and Formulas
• On the semantics of place/transition Petri nets
• Minimal transition systems for history-preserving bisimulation
• Interleaving vs True Concurrency: Some Instructive Security Examples
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets