Generalising automaticity to modal properties of finite structures

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

Volumn 2556 LNCS, Issue , 2002, Pages 109-120

  Dawar, A ^a   Kreutzer, S ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LABELS; SOFTWARE ENGINEERING;

COMPLEXITY MEASURES; EXPRESSIVE POWER; FINE GRAINED; FINITE STRUCTURES; LABELLING SYSTEMS; MODAL FIXED-POINT LOGIC; MODAL PROPERTIES;

STRUCTURAL PROPERTIES;

EID: 0041524733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_11     Document Type: Conference Paper

References (11)

1. A. Arnold and D. Niwiński. Rudiments of μ-calculus. North Holland, 2001.
2. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
3. A. Dawar, E. Grädel, and S. Kreutzer. Inflationary fixed points in modal logic. In Proc. of the 10th Conf. on Computer Science Logic (CSL), volume 2142 of LNCS, pages 277-291. Springer, 2001. Full version at http://www.cl.cam.ac.uk/~ad260/papers/mic.ps.
4. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1-68. Springer, 1997.
5. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In Proceedings of 7th International Conference on Concurrency Theory CONCUR '96, volume 1119 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
6. M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237-265, 1999.
7. J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53:10-25, 1996.
8. C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001.
9. W. Thomas. On logics, tilings, and automata. In J. Leach et al., editor, Automata, Languages, and Programming, Lecture Notes in Computer Science Nr. 510, pages 441-453. SpringerVerlag, 1991.
10. W. Thomas. Finite-state recognizability and logic: from words to graphs. In 13th World Computer Congress 94, volume 1, pages 499-506. Elsevier Science, 1994.
11. W. Thomas. Languages, automata and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 389-455. Springer, 1997.