History preserving bisimulation for contextual nets

DOI10.1007/978-3-540-44616-3_17MaRDI QIDQ2722031zbMATH OpenFDO

Authors Paolo Baldan, Andrea Corradini, Ugo Montanari

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-44616-3_17

Mathematics Subject Classification ID

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

Recommendations

• Minimal transition systems for history-preserving bisimulation
• Deciding history preserving bisimilarity
• scientific article; zbMATH DE number 1497782
• On plain and hereditary history-preserving bisimulation
• Hereditary history preserving bisimilarity is undecidable

Cited in

(9)

• Hereditary History-Preserving Bisimilarity: Logics and Automata
• Adhesive DPO parallelism for monic matches
• Deciding history preserving bisimilarity
• Hereditary history preserving bisimulation is decidable for trace-labelled systems
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Concurrency for Graph Grammars in a Petri net shell
• On plain and hereditary history-preserving bisimulation
• Minimal transition systems for history-preserving bisimulation
• CONCUR 2005 – Concurrency Theory

This page was built for publication: History preserving bisimulation for contextual nets

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