An automata-theoretical characterization of the OI-hierarchy
Information and Control
Handbook of theoretical computer science (vol. B)
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Monadic second-order logic on tree-like structures
Theoretical Computer Science
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Prefix-recognizable graphs and monadic logic
Automata logics, and infinite games
The monadic theory of tree-like structures
Automata logics, and infinite games
Model Checking Synchronized Products of Infinite Transition Systems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Reachability Problems on Regular Ground Tree Rewriting Graphs
Theory of Computing Systems
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
We report on recent progress in the study of infinite transition systems for which interesting properties (like reachability of designated states) can be checked algorithmically. Two methods for the generation of such models are discussed: the construction from simpler models via operations like unfolding and synchronized product, and the internal representation of state spaces by regular sets of words or trees.