Two Observations in Dioid Based Model Refinement
Dioid based model refinement is an abstract framework for optimality problems on labelled graphs such as the shortest path problem or the maximum capacity problem. Here we show two facts in this area: first, via a language theoretic approach that models with a binary set of edge labels are refinable, and second, the compatibility of linear fixpoint equations with bisimulations. These equations can be used in an algebraic setting for a certain class of optimality problems. Since bisimulations can simplify the complexity of models, they can also reduce the complexity of certain optimality problems.
KeywordsModel Check Adjacency Matrix Target Model Target Distance Short Path Problem
Unable to display preview. Download preview PDF.
- 1.Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press (2008)Google Scholar
- 2.Ciarlet, P.G.: Introduction to Numerical Linear Algebra and Optimisation. Cambridge University Press (1989)Google Scholar
- 5.Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer (2008)Google Scholar
- 7.Kleene, S.: Introduction to Metamathematics. Wolters-Noordhoff - Groningen (1952)Google Scholar
- 8.Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, pp. 112–137 (1957)Google Scholar
- 11.Schmidt, G., Ströhlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer (1993)Google Scholar