Two observations in dioid based model refinement

DOI10.1007/978-3-642-33314-9_16MaRDI QIDQ2915147zbMATH OpenOpenAlexWikidataFDO

Authors Roland Glück

Publication date 21 September 2012

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-33314-9_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Ordered semigroups and monoids (06F05)

Recommendations

• Using bisimulations for optimality problems in model refinement
• Model refinement using bisimulation quotients
• Graphs, dioids and semirings. New models and algorithms.
• Relational concurrent refinement
• scientific article; zbMATH DE number 1951183

Cites work

• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• A relation-algebraic theory of bisimulations
• Graphs, dioids and semirings. New models and algorithms.
• Linear Automaton Transformations
• Model refinement using bisimulation quotients
• Pathfinding through congruences
• Three Partition Refinement Algorithms
• Using bisimulations for optimality problems in model refinement

Cited in

(1)

• Using bisimulations for optimality problems in model refinement

This page was built for publication: Two observations in dioid based model refinement

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