Two Observations in Dioid Based Model Refinement
From MaRDI portal
Publication:2915147
DOI10.1007/978-3-642-33314-9_16zbMath1364.68307OpenAlexW33546943WikidataQ62039039 ScholiaQ62039039MaRDI QIDQ2915147
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
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Ordered semigroups and monoids (06F05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs, dioids and semirings. New models and algorithms.
- A lattice-theoretical fixpoint theorem and its applications
- Using Bisimulations for Optimality Problems in Model Refinement
- Pathfinding through Congruences
- Model Refinement Using Bisimulation Quotients
- Linear Automaton Transformations
- Three Partition Refinement Algorithms
This page was built for publication: Two Observations in Dioid Based Model Refinement