TY - GEN
T1 - Parametric modal transition systems
AU - Beneš, Nikola
AU - Křetínský, Jan
AU - Larsen, Kim G.
AU - Møller, Mikael H.
AU - Srba, Jiří
PY - 2011
Y1 - 2011
N2 - Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcome many of the limitations and we investigate the computational complexity of modal refinement checking.
AB - Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcome many of the limitations and we investigate the computational complexity of modal refinement checking.
UR - http://www.scopus.com/inward/record.url?scp=80054074253&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24372-1_20
DO - 10.1007/978-3-642-24372-1_20
M3 - Conference contribution
AN - SCOPUS:80054074253
SN - 9783642243714
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 275
EP - 289
BT - Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings
T2 - 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011
Y2 - 11 October 2011 through 14 October 2011
ER -