Deciding true concurrency equivalences on finite safe nets (preliminary report)

DOI10.1007/3-540-56939-1_99zbMath1422.68170OpenAlexW1582378946MaRDI QIDQ4630288

Albert R. Meyer, Lalita Jategaonkar

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_99

zbMATH Keywords

finite automatonpartial orderisomorphism classdecision procedurevisible transition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Petri nets, traces, and local model checking ⋮ Behavioural equivalence for infinite systems — Partially decidable! ⋮ Complexity results for 1-safe nets ⋮ Petri nets, traces, and local model checking

Cites Work

• Step failures semantics and a complete proof system
• Failures semantics based on interval semiwords is a congruence for refinement
• CCS expressions, finite state processes, and three problems of equivalence
• Maximality preserving bisimulation
• Concurrent bisimulations in Petri nets
• A Theory of Communicating Sequential Processes
• Checking equivalences between concurrent systems of finite agents (Extended abstract)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding true concurrency equivalences on finite safe nets (preliminary report)