Name
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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0168-0072(97)00048-1 | Annals of Pure and Applied Logic |
Keywords | Field | DocType |
Second-order logic,Rabin automaton,Infinite tree,Semantics,Transition Systems,Graph covering | Transition system,Discrete mathematics,Graph,Combinatorics,Second-order logic,Monadic second-order logic,Clique-width,Mathematics,Semantics,Monad (functional programming),Monadic predicate calculus | Journal |
Volume | Issue | ISSN |
92 | 1 | 0168-0072 |
Citations | PageRank | References |
26 | 1.71 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Courcelle | 1 | 3418 | 388.00 |
| Igor Walukiewicz | 2 | 1239 | 90.24 |