Abstract
We introduce a complexity measure of modal properties of finite structures which generalises the automaticity of languages. It is based on graph-automata like devices called labelling systems. We define a measure of the size of a structure that we call rank, and show that any modal property of structures can be approximated up to any fixed rank n by a labelling system. The function that takes n to the size of the smallest labelling system doing this is called the labelling index of the property. We demonstrate that this is a useful and fine-grained measure of complexity and show that it is especially well suited to characterise the expressive power of modal fixed-point logics. From this we derive several separation results of modal and non-modal fixed-point logics, some of which are already known whereas others are new.
Research supported by EPSRC grant GR/N23028.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Arnold and D. Niwiński. Rudiments of μ-calculus. North Holland, 2001.
P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
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.
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.
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.
M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237–265, 1999.
J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53:10–25, 1996.
C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001.
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. Springer-Verlag, 1991.
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.
W. Thomas. Languages, automata and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 389–455. Springer, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dawar, A., Kreutzer, S. (2002). Generalising Automaticity to Modal Properties of Finite Structures. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive