Mona: Monadic second-order logic in practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1019, Issue , 1995, Pages 89-110

  Henriksen, Jesper G ^a   Jensen, Jakob ^a   Jørgensen, Michael ^a   Klarlund, Nils ^a   Paige, Robert ^b   Rauhe, Theis ^a   Sandholm, Anders ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; PHILOSOPHICAL ASPECTS; TEMPORAL LOGIC; TEXT PROCESSING;

AUTOMATIC PROOFS; BINARY DECISION DIAGRAMS (BDDS); DECISION PROCEDURE; DINING PHILOSOPHERS; DISTRIBUTED SYSTEMS; MONADIC SECOND-ORDER LOGIC; REGULAR EXPRESSIONS; TRANSITION FUNCTIONS;

COMPUTER CIRCUITS;

EID: 84957808228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60630-0_5     Document Type: Conference Paper

References (17)

1. A. Aho, J. Hopcroft, and J. Ullman. Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. D. Basin and N. Klarlund. Hardware verification using monadic second-order logic. Technical Report RS-96-7, BRICS, 1995. To appear in CAV '95 Proceedings.
3. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug 1986.
4. R. E. Bryant. Symbolic binary-decision diagrams. 318, September 1992. Boolean manipulation with ordered ACM Computing surveys, 24(3):293-318, September 1992.
5. F. Balarin and A.L. Sangiovanni-Vincentelli. An iterative approach to language containment. In Computer Aided Verification, CAV '93, LNCS 697, pages 29-40, 1993.
6. J. Cai and R. Palge. Using multiset discrimination to solve language processing problems without hashing, to appear Theoretical Computer Science, 1994. also, U. of Copenhagen Tech. Report, DIKU-TR Num. D-209, 94/16, URL ftp://ftp.diku.dk/diku/semantics/papers/D-209.ps.Z.
7. M-M Corsini and A. Rauzy. Symbolic model checking and constraint logic programming: a cross-fertilisation. In 5th. Europ. Syrup. on Programming, LNCS 788, pages 180-194, 1994.
8. A. Gupta and A.L. Fisher. Parametric circuit representation using inductive boolean functions. In Computer Aided Verification, CAV '93, LNCS 697, pages 15-28, 1993.
9. J. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Z. Kohavi and Paz A., editors, Theory of machines and computation, pages 189-196. Academic Press, 1971
10. J. Jensen, M. JCrgensen, and N. Klarltmd. Monadic second-order logic for parameterized verification. Technical report, BRICS Report Series RS-94-10, Department of Computer SOence, University of Aarhus, 1994.
11. B. Kurshan and K. McMillan. A structural induction theorem for processes. In Proe. Eigth Syrup. Princ. of Distributed Computing, pages 239-247, 1989.
12. R. Palge and R. Tarjan. Three efficient algorithms based on partition refinement. SIAM Journal of Computing, 16(6), 1987.
13. D. Revuz. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181-189, 1992
14. J-K. Rho and F. Somenzi. Automatic generation of network invariants for the verification of iterative sequential systems. In Computer Aided Verification, CAV '93, LNCS 697, pages 123-137, 1993.
15. M. Steinmann. Übersetzung yon logischen Ausdriicken in Baumautomaten: Entwicklung eines Verfahrens und seine Implementierung. Unpublished, 1993.
16. D. Sieling and I. Wegener. Reduction of OBDDs in linear time. IPL, 48:139-144, 1993
17. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pges 133-191. MIT Press/Elsevier, 1990.