CCS expressions finite state processes, and three problems of equivalence
Information and Computation
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
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
Using bisimulations for optimality problems in model refinement
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
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 |
The paper shows how to refine large-scale or even infinite transition systems so as to ensure certain desired properties. First, a given system is reduced into a smallish, finite bisimulation quotient. Second, the reduced system is refined in order to ensure a given property, using any known finite-state method. Third, the refined reduced system is expanded back into an adequate refinement of the system given initially. The proposed method is based on a Galois connection between systems and their quotients. It is applicable to various models and bisimulations and is illustrated with a few qualitative and quantitative properties.