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

DOI10.1007/3-540-56939-1_99MaRDI QIDQ4630288zbMATH OpenOpenAlexFDO

Authors Lalita Jategaonkar, Albert R. Meyer

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

decision procedurefinite automatonisomorphism classpartial ordervisible transition

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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)

Recommendations

• Deciding true concurrency equivalences on safe, finite nets
• Complexity results for 1-safe nets
• scientific article; zbMATH DE number 1555184
• Petri nets and regular processes
• scientific article; zbMATH DE number 2102771

Cites work

• A Theory of Communicating Sequential Processes
• CCS expressions, finite state processes, and three problems of equivalence
• Checking equivalences between concurrent systems of finite agents (extended abstract)
• Concurrent bisimulations in Petri nets
• Failures semantics based on interval semiwords is a congruence for refinement
• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 4030999 (Why is no real title available?)
• scientific article; zbMATH DE number 4074506 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 17804 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176514 (Why is no real title available?)
• scientific article; zbMATH DE number 176758 (Why is no real title available?)
• scientific article; zbMATH DE number 3995041 (Why is no real title available?)
• Maximality preserving bisimulation
• Step failures semantics and a complete proof system

Cited in

(7)

• Deciding true concurrency equivalences on safe, finite nets
• Petri nets, traces, and local model checking
• scientific article; zbMATH DE number 1555184 (Why is no real title available?)
• Behavioural equivalence for infinite systems -- partially decidable!
• Petri nets, traces, and local model checking
• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
• Complexity results for 1-safe nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630288)