Skip to main content
SpringerLink
Log in

Two Observations in Dioid Based Model Refinement

  • Conference paper
Relational and Algebraic Methods in Computer Science (RAMICS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7560))

  • 462 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  3. 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)

    Chapter  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer (2008)

    Google Scholar 

  6. 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)

    Chapter  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 

  9. Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society 9(4), 541–544 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  10. Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal for Computing 16(6), 973–989 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  11. Schmidt, G., Ströhlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer (1993)

    Google Scholar 

  12. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2), 285–309 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  13. Winter, M.: A relation-algebraic theory of bisimulations. Fundam. Inf. 83(4), 429–449 (2008)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, D-86135, Augsburg, Germany

    Roland Glück

Authors
  1. Roland Glück
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    Wolfram Kahl

  2. Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, CB3 0FD, Cambridge, UK

    Timothy G. Griffin

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation