Behavioural equivalence for infinite systems — Partially decidable!

DOI10.1007/3-540-61363-3_25zbMath1418.68154OpenAlexW1583597163MaRDI QIDQ4633177

Mogens Nielsen, Kim Sunesen

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_25

zbMATH Keywords

Petri netsdecidabilitybehavioural equivalenceprocess calculipartial-order methods

Mathematics Subject Classification ID

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

Related Items (1)

Behavioural equivalence for infinite systems — Partially decidable!

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observing localities
• Specification-oriented semantics for communicating processes
• Modeling concurrency with partial orders
• Persistence of vector replacement systems is decidable
• Finite representations of CCS and TCSP programs by automata and Petri nets
• A note on the representation of finite tree automata
• A static view of localities
• The Complexity of the Finite Containment Problem for Petri Nets
• Bottom-up and top-down tree transformations— a comparison
• Deciding true concurrency equivalences on finite safe nets (preliminary report)
• Behavioural equivalence for infinite systems — Partially decidable!

This page was built for publication: Behavioural equivalence for infinite systems — Partially decidable!