RT Conference Proceedings
T1 When are prime formulae characteristic?
A1 Aceto, Luca
A1 Della Monica, Dario
A1 Fábregas Alfaro, Ignacio
A1 Ingólfsdóttir, Anna
A2 Italiano, Giuseppe
A2 Pighizzini, Giovanni
A2 Sannella, Donald
AB 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.
SN 978-3-662-48057-1_6
YR 2015
FD 2015
LK https://hdl.handle.net/20.500.14352/99369
UL https://hdl.handle.net/20.500.14352/99369
LA eng
NO 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
DS Docta Complutense
RD 23 abr 2025