When are prime formulae characteristic?
Loading...
Download
Official URL
Full text at PDC
Publication date
2015
Advisors (or tutors)
Journal Title
Journal ISSN
Volume Title
Publisher
Citations
Exportar
Citation
Aceto, L., Della Monica, D., Fábregas, I., Ingólfsdóttir, A. (2015). When Are Prime Formulae Characteristic?. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48057-1_6
Abstract
In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are exactly the consistent and prime ones. This paper presents general, sufficient conditions guaranteeing that characteristic formulae are exactly the consistent and prime ones. It is shown that the given conditions apply to the logics characterizing all the semantics in van Glabbeek’s branching-time spectrum.