Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press (2008)
Ciarlet, P.G.: Introduction to Numerical Linear Algebra and Optimisation. Cambridge University Press (1989)
Glück, R.: Using Bisimulations for Optimality Problems in Model Refinement. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 164–179. Springer, Heidelberg (2011)
Glück, R., Möller, B., Sintzoff, M.: Model Refinement Using Bisimulation Quotients. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 76–91. Springer, Heidelberg (2011)
Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer (2008)
Gurney, A.J.T., Griffin, T.G.: Pathfinding through Congruences. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 180–195. Springer, Heidelberg (2011)
Kleene, S.: Introduction to Metamathematics. Wolters-Noordhoff - Groningen (1952)
Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, pp. 112–137 (1957)
Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society 9(4), 541–544 (1958)
Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal for Computing 16(6), 973–989 (1987)
Schmidt, G., Ströhlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer (1993)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2), 285–309 (1955)
Winter, M.: A relation-algebraic theory of bisimulations. Fundam. Inf. 83(4), 429–449 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glück, R. (2012). Two Observations in Dioid Based Model Refinement. In: Kahl, W., Griffin, T.G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2012. Lecture Notes in Computer Science, vol 7560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33314-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-33314-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33313-2
Online ISBN: 978-3-642-33314-9
eBook Packages: Computer ScienceComputer Science (R0)