Using bisimulations for optimality problems in model refinement

DOI10.1007/978-3-642-21070-9_14MaRDI QIDQ3007576zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roland Glück

Publication date 17 June 2011

Published in Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21070-9_14

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model refinement using bisimulation quotients
• Two observations in dioid based model refinement
• Sigref – A Symbolic Bisimulation Tool Box
• A fully symbolic bisimulation algorithm
• An efficient fully symbolic bisimulation algorithm for non-deterministic systems

Cited in

(7)

• Two observations in dioid based model refinement
• Model refinement using bisimulation quotients
• scientific article; zbMATH DE number 1794369 (Why is no real title available?)
• scientific article; zbMATH DE number 2119841 (Why is no real title available?)
• Compatibility of refining and controlling plant automata with bisimulation quotients
• A matrix-oriented view of bisimulation quotients over dioid-labeled transition systems
• Simulation quotients simulating bisimulation quotients

This page was built for publication: Using bisimulations for optimality problems in model refinement

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