Using Bisimulations for Optimality Problems in Model Refinement
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.
KeywordsModel Check Target Model Label Graph Edge Label Liveness Property
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
- 11.Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112–137 (1957)Google Scholar
- 13.Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal for Computing 16(6)Google Scholar