Download:
|
by Jesper G. Henriksen, Jakob Jensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders Sandholm
http://www.brics.dk/~sandholm/Papers/Mona/article.ps.gz
Add To MetaCart
Abstract:
1 The purpose of this article is to introduce Monadic Secondorder Logic as a practical means of specifying regularity. The logic is a highly succinct alternative to the use of regular expressions. We have built a tool MONA, which acts as a decision procedure and as a translator to ��nitestate automata. The tool is based on new algorithms for minimizing ��nitestate automata that use binary decision diagrams (BDDs) to represent transition functions in compressed form. A byproduct of this work is an algorithm that matches the time but improves the space of Sieling and Wegener's algorithm to reduce OBDDs in linear time. The potential applications are numerous. We discuss text processing, Boolean circuits, and distributed systems. Our main example is an automatic proof of properties for the iDining Philosophers with Encyclopediaj example by Kurshan and MacMillan. We establish these properties for the parameterized case without the use of induction. Our results show that, contrary to common beliefs, high computational complexity may be a desired feature of a speci��cation formalism.
Citations
|
2315
|
Graph-based algorithms for boolean function manipulation
– Bryant
- 1986
|
|
2003
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
723
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Bryant
- 1992
|
|
113
|
A structural induction theorem for processes
– Kurshan, McMillan
- 1989
|
|
53
|
An itertaive approach to language containment
– Balarin, Sangiovanni-Vincentelli
- 1993
|
|
33
|
Minimisation of acyclic deterministic automata in linear time
– Revuz
- 1991
|
|
21
|
Using multiset discrimination to solve language processing problems without hashing
– Cai, Paige
- 1995
|
|
17
|
Reduction of OBDDs in linear time
– Sieling, Wegener
- 1993
|
|
16
|
Parametric circuit representation using inductive boolean functions
– Gupta, Fisher
- 1993
|
|
10
|
Automata on innite objects
– Thomas
- 1990
|
|
8
|
An nlogn algorithm for minimizing the states in a nite automaton
– Hopcroft
- 1971
|
|
5
|
Symbolic model checking and constraint logic programming: a cross-fertilisation
– Corsini, Rauzy
- 1994
|
|
3
|
Monadic second-order logic for parameterized verification
– Jensen, Jrgensen, et al.
- 1994
|
|
1
|
Hardware veri��cation using monadic second-order logic
– Basin, Klarlund
- 1995
|
|
1
|
Three eOEcient algorithms based on partition re��nement
– Paige, Tarjan
- 1987
|
|
1
|
Automatic generation of network invariants for the veri��cation of iterative sequential systems
– Rho, Somenzi
- 1993
|
|
1
|
bersetzung von logischen Ausdr#cken in Baumautomaten: Entwicklung eines Verfahrens und seine Implementierung. Unpublished
– Steinmann
- 1993
|
