Monadic second-order logic, graph coverings and unfoldings of transition systems

Annals of Pure and Applied Logic 92 (1):35-62 (1998)
  Copy   BIBTEX

Abstract

We prove that every monadic second-order property of the unfolding of a transition system is a monadic second-order property of the system itself. An unfolding is an instance of the general notion of graph covering. We consider two more instances of this notion. A similar result is possible for one of them but not for the other

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Graph structure and monadic second-order logic: a language-theoretic approach.B. Courcelle - 2012 - New York: Cambridge University Press. Edited by Joost Engelfriet.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
The monadic second-order logic of graphs VIII: Orientations.Bruno Courcelle - 1995 - Annals of Pure and Applied Logic 72 (2):103-143.
Relations in monadic third-order logic.A. P. Hazen - 1997 - Journal of Philosophical Logic 26 (6):619-628.
Querying linguistic treebanks with monadic second-order logic in linear time.Stephan Kepser - 2004 - Journal of Logic, Language and Information 13 (4):457-470.
Logic of transition systems.Johan Van Benthem & Jan Bergstra - 1994 - Journal of Logic, Language and Information 3 (4):247-283.
Logic of transition systems.Johan Benthem & Jan Bergstra - 1994 - Journal of Logic, Language and Information 3 (4):247-283.

Analytics

Added to PP
2014-01-16

Downloads
33 (#480,801)

6 months
3 (#967,057)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations