Three partition refinement algorithms
SIAM Journal on Computing
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
A Relation-Algebraic Theory of Bisimulations
Fundamenta Informaticae
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Derivation Tree Analysis for Accelerated Fixed-Point Computation
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A Model of Internet Routing Using Semi-modules
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
A Semiring Approach to Equivalences, Bisimulations and Control
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Model refinement using bisimulation quotients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
On the cardinality of relations
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Two observations in dioid based model refinement
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 0.00 |
A known generic strategy for handling large transition systems is the combined use of bisimulations and refinement. The idea is to reduce a large system by means of a bisimulation quotient into a smaller one, then to refine the smaller one in such way that it fulfils a desired property, and then to expand this refined system back into a submodel of the original one. This generic algorithm is not guaranteed to work correctly for every desired property; here we show its correctness for a class of optimality problems which can be described in the framework of dioids.