Monadic second-order logics with cardinalities

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

Volumn 2719, Issue , 2003, Pages 681-696

  Klaedtke, Felix ^a   Rueß, Harald ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE;

AUTOMATON MODEL; CARDINALITIES; CARDINALITY CONSTRAINTS; FINITE SUBSETS; MONADIC SECOND-ORDER LOGIC; NATURAL NUMBER; UNDECIDABILITY; WEAK MONADIC SECOND-ORDER LOGIC;

FORMAL LOGIC;

EID: 35248813299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_54     Document Type: Article

References (28)

1. D. BASIN AND S. FRIEDRICH, Combining WS1S and HOL, in FroCos'98, Applied Logic Series, 2000, pp. 39-56.
2. D. BASIN, S. FRIEDRICH, AND S. MÖDERSHEIM, B2M: A semantic based tool for BLIF hardware descriptions, in FMCAD'00, vol. 1954 of LNCS, 2000, pp. 91-107.
3. D. BASIN AND N. KLARLUND, Automata based symbolic reasoning in hardware verification, FMSD, 13 (1998), pp. 255-288.
4. H. COMON AND Y. JURSKI, Multiple counters automata, safety analysis and Presburger arithmetic, in CAV'98, vol. 1427 of LNCS, 1998, pp. 268-279.
5. S. DAL ZILIO AND D. LUGIEZ, XML schema, tree logic and sheaves automata, Research Report 4631, INRIA, 2002.
6. J. DASSOW AND V. MITRANA, Finite automata over free groups, International Journal of Algebra and Computation, 10 (2000), pp. 725-737.
7. A. FINKEL AND G. SUTRE, Decidability of rechability problems for classes of two counter automata, in STACS'00, vol. 1770 of LNCS, 2000, pp. 346-357.
8. M. GORDON, Why higher-order logics is a good formalism for specifying and verifying hardware, in Formal Aspects of VLSI Design, North-Holland, 1986, pp. 153-177.
9. G. GOTTLOB AND C. KOCH, Monadic Datalog and the expressive power of languages for web information extraction, in PODS'02, 2002, pp. 17-28.
10. J. HENRIKSEN, J. JENSEN, M. JORGENSEN, N. KLARLUND, B. PAIGE, T. RAUHE, AND A. SANDHOLM, Mona: Monadic second-order logic in practice, in TACAS'95, vol. 1019 of LNCS, 1995, pp. 89-110.
11. O. IBARRA, Reversal-bounded multicounter machines and their decision problems, JACM, 25 (1978), pp. 116-133.
12. O. IBARRA, J. Su, Z. DANG, T. BULTAN, AND R. KEMMERER, Counter machines and verification problems, TCS, 289 (2002), pp. 165-189.
13. F. KLAEDTKE, CMona: Monadic second-order logics with linear cardinality constraints in practice, in preparation, 2003.
14. F. KLAEDTKE AND H. RUESS, WS1S with cardinality constraints, Technical Report SRI-CSL-05-01, SRI International, 2001.
15. -, Parikh automata and monadic second-order logics with linear cardinality constraints, Technical Report 177, Albert-Ludwigs-Universität Freiburg, 2002. (revised version).
16. N. KLARLUND, A. MØLLER, AND M. SCHWARTZBACH, MONA implementation secrets, in CIAA'00, vol. 2088 of LNCS, 2000, pp. 182-194.
17. N. KLARLUND, M. NIELSEN, AND K. SUNESEN, Automated logical verification based on trace abstraction, in PODC'96, 1996, pp. 101-110.
18. L. LAMPORT, R. SHOSTAK, AND M. PEASE, The Byzantine Generals problem, TOPLAS, 4 (1982), pp. 382-401.
19. A. MEYER, Weak monadic second-order theory of successor is not elementary-recursive, in Logic Colloquium, vol. 453 of LNM, 1975, pp. 132-154.
20. V. MITRANA AND R. STIEBE, Extended finite automata over groups, Discrete Applied Mathematics, 108 (2001), pp. 287-300.
21. S. OWRE AND H. RUESS, Integrating WS1S with PVS, in CAV'00, vol. 1855 of LNCS, 2000, pp. 548-551.
22. M. PARIGOT AND E. PELZ, A logical approach of Petri net languages, TCS, 39 (1985), pp. 155-169.
23. R. PARIKH, On context-free languages, JACM, 13 (1966), pp. 570-581.
24. J. RUSHBY, Systematic formal verification for fault-tolerant time-triggered algorithms, IEEE Trans. on Software Engineering, 2 (1999), pp. 651-660.
25. M. SMITH AND N. KLARLUND, Verification of a sliding window protocol using IOA and MONA, in FORTE/PSTV'00, vol. 183 of IFIP Conf. Proc., 2000, pp. 19-34.
26. L. STOCKMEYER, The Complexity of Decision Problems in Automata Theory and Logic, PhD thesis, Dept. of Electrical Engineering, MIT, Boston, Mass., 1974.
27. W. THOMAS, Languages, automata, and logic, in Handbook of Formal Languages, vol. 3, Springer-Verlag, 1997, pp. 389-455.
28. A. WILK AND A. PNUELI, Specification and verification of VLSI systems, in ICCAD'89, 1989, pp. 460-463.