Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach

  • Corina Cîrstea
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6859)

Abstract

We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regular two-player game. Our approach is inspired by the automata-theoretic approach to model checking Linear Temporal Logic over transition systems.

Keywords

coalgebra trace temporal logic automata model checking 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baltag, A.: A logic for coalgebraic simulation. In: Proc. CMCS 2000. Electr. Notes Theor. Comput. Sci., vol. 33, pp. 42–60 (2000)Google Scholar
  2. 2.
    Cîrstea, C.: Generic infinite traces and path-based coalgebraic temporal logics. In: Proc. CMCS 2010. Electr. Notes Theor. Comput. Sci., vol. 264, pp. 83–103 (2010)Google Scholar
  3. 3.
    Fontaine, G., Leal, R., Venema, Y.: Automata for coalgebras: an approach using predicate liftings. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 381–392. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Jacobs, B.: Trace semantics for coalgebras. In: Proc. CMCS 2004. Electr. Notes Theor. Comput. Sci., vol. 106, pp. 167–184 (2004)Google Scholar
  5. 5.
    Kupke, C., Venema, Y.: Coalgebraic automata theory: basic results. Logical Methods in Computer Science 4(4) (2008)Google Scholar
  6. 6.
    Mazala, R.: 2 infinite games. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 23–38. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Vardi, M.: Automata-theoretic techniques fo temporal reasoning. In: Handbook of Modal Logic, pp. 971–990. Addison Wesley, Reading (2005)Google Scholar
  8. 8.
    Venema, Y.: Automata and fixed point logics: a coalgebraic perspective. Information and Computation 204, 637–678 (2006)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Corina Cîrstea
    • 1
  1. 1.University of SouthamptonUK

Personalised recommendations