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

DOI10.1007/3-540-56939-1_99zbMath1422.68170MaRDI 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 automaton; partial order; isomorphism class; decision procedure; visible transition

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Complexity results for 1-safe nets, Petri nets, traces, and local model checking