Automata for the verification of monadic second-order graph properties

&
Journal of Applied Logic 10 (4):368-409 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.jal.2011.07.001

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Monadic second-order logic, graph coverings and unfoldings of transition systems.Bruno Courcelle & Igor Walukiewicz - 1998 - Annals of Pure and Applied Logic 92 (1):35-62.
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (1):1-21.
Graph structure and monadic second-order logic: a language-theoretic approach.B. Courcelle - 2012 - New York: Cambridge University Press. Edited by Joost Engelfriet.
Finite State Automata and Monadic Definability of Singular Cardinals.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):412 - 438.
The monadic second-order logic of graphs VIII: Orientations.Bruno Courcelle - 1995 - Annals of Pure and Applied Logic 72 (2):103-143.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Decidable properties for monadic abstract state machines.Daniele Beauquier - 2006 - Annals of Pure and Applied Logic 141 (3):308-319.
Reviewed Work(s): Graph structure and monadic second-order logic. Encyclopedia of Mathematics and Its Applications, vol. 138 by Bruno Courcelle; Joost Engelfriet.Review by: Achim Blumensath - 2013 - Bulletin of Symbolic Logic 19 (3):394-396,.
Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.
Logical aspects of Cayley-graphs: the group case.Dietrich Kuske & Markus Lohrey - 2004 - Annals of Pure and Applied Logic 131 (1-3):263-286.
Simple monadic theories and indiscernibles.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (1):65-86.
On countable chains having decidable monadic theory.Alexis Bés & Alexander Rabinovich - 2012 - Journal of Symbolic Logic 77 (2):593-608.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
On winning Ehrenfeucht games and monadic NP.Thomas Schwentick - 1996 - Annals of Pure and Applied Logic 79 (1):61-92.

Analytics

Added to PP
2016-06-30

Downloads
13 (#1,028,363)

6 months
7 (#418,756)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references