When are prime formulae characteristic?

التفاصيل البيبلوغرافية
العنوان:	When are prime formulae characteristic?
المؤلفون:	L. Aceto, Della Monica, D., I. F'abregas, A. Ing'olfsd'ottir
المساهمون:	L. Aceto, D. Della Monica, I. Fábregas, A. Ingólfsdóttir, Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, L., Aceto, Della Monica, D., I., F'Abrega, A., Ing'Olfsd'Ottir
بيانات النشر:	Springer-Verlag Berlin Heidelberg
سنة النشر:	2015
المجموعة:	Università degli Studi di Udine: CINECA IRIS
مصطلحات موضوعية:	process semantics, logics, characteristic formulae, (bi)simulation
الوصف:	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.
نوع الوثيقة:	conference object
اللغة:	English
Relation:	info:eu-repo/semantics/altIdentifier/wos/WOS:000371025600011; ispartofbook:Proc. of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS)---Part I; 40th International Symposium on Mathematical Foundations of Computer Science (MFCS); volume:9234; firstpage:76; lastpage:88; numberofpages:13; alleditors:Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella; http://hdl.handle.net/11390/1201748; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84943594350
DOI:	10.1007/978-3-662-48057-1_6
الاتاحة:	http://hdl.handle.net/11390/1201748 https://doi.org/10.1007/978-3-662-48057-1_6
Rights:	info:eu-repo/semantics/openAccess
رقم الانضمام:	edsbas.29F44CF5
قاعدة البيانات:	BASE

View record in BASE

الوصف
DOI:	10.1007/978-3-662-48057-1_6