[图书][B] Handbook of Formal Languages: Volume 3 Beyond Words
G Rozenberg, A Salomaa - 2012 - books.google.com
The need for a comprehensive survey-type exposition on formal languages and related
mainstream areas of computer science has been evident for some years. In the early 1970s …
mainstream areas of computer science has been evident for some years. In the early 1970s …
[图书][B] Graph structure and monadic second-order logic: a language-theoretic approach
B Courcelle, J Engelfriet - 2012 - books.google.com
The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …
can be described algebraically, enabling them to be constructed out of more basic elements …
Languages, automata, and logic
W Thomas - Handbook of Formal Languages: Volume 3 Beyond …, 1997 - Springer
The subject of this chapter is the study of formal languages (mostly languages recognizable
by finite automata) in the framework of mathematical logic. The connection between …
by finite automata) in the framework of mathematical logic. The connection between …
Mona: Monadic second-order logic in practice
JG Henriksen, J Jensen, M Jørgensen… - Tools and Algorithms for …, 1995 - Springer
The purpose of this article is to introduce Monadic Second-order Logic as a practical means
of specifying regularity. The logic is a highly succinct alternative to the use of regular …
of specifying regularity. The logic is a highly succinct alternative to the use of regular …
[图书][B] Automata theory and its applications
B Khoussainov, A Nerode - 2012 - books.google.com
The theory of finite automata on finite stings, infinite strings, and trees has had a dis
tinguished history. First, automata were introduced to represent idealized switching circuits …
tinguished history. First, automata were introduced to represent idealized switching circuits …
[图书][B] Mona version 1.4: User manual
N Klarlund, A Møller - 2001 - brics.dk
It has been known since 1960 that the class of regular languages1 is linked to decidability
questions in formal logics. In particular, WS1S (Weak monadic Second-order theory of 1 …
questions in formal logics. In particular, WS1S (Weak monadic Second-order theory of 1 …
Symbolic model checking with rich assertional languages
Y Resten, O Maler, M Marcus, A Pnueli… - … Aided Verification: 9th …, 1997 - Springer
The paper shows that, by an appropriate choice of a rich assertional language, it is possible
to extend the utility of symbolic model checking beyond the realm of BDD-represented finite …
to extend the utility of symbolic model checking beyond the realm of BDD-represented finite …
Symbolic model checking with rich assertional languages
Y Kesten, O Maler, M Marcus, A Pnueli… - Theoretical Computer …, 2001 - Elsevier
The paper shows that, by an appropriate choice of a rich assertional language, it is possible
to extend the utility of symbolic model checking beyond the realm of BDD-represented finite …
to extend the utility of symbolic model checking beyond the realm of BDD-represented finite …
Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results
Model checking is a powerful technique for analyzing large, finite-state systems. In an infinite
state system, however, many basic properties are undecidable. In this article, we present a …
state system, however, many basic properties are undecidable. In this article, we present a …
MONA implementation secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S
and WS2S. It has been used for numerous applications, and it is remarkably efficient in …
and WS2S. It has been used for numerous applications, and it is remarkably efficient in …