@inproceedings{10.1007/978-3-642-03466-4_7,
Abstract = {Modal transition systems (MTS), a specification formalism introduced more than 20 years ago, has recently received a considerable attention in several different areas. Many of the fundamental questions related to MTSs have already been answered. However, the problem of the exact computational complexity of thorough refinement checking between two finite MTSs remained unsolved.},
Address = {Berlin, Heidelberg},
Author = {Bene{\v{s}}, Nikola and K{\v{r}}et{\'\i}nsk{\'y}, Jan and Larsen, Kim G. and Srba, Ji{\v{r}}{\'\i}},
BookTitle = {Theoretical Aspects of Computing - ICTAC 2009},
Editor = {Leucker, Martin and Morgan, Carroll},
File = {Beneš2009\_Chapter\_CheckingThoroughRefinementOnMo - a - a - y.pdf},
ISBN = {978-3-642-03466-4},
Pages = {112--126},
Publisher = {Springer Berlin Heidelberg},
Title = {Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete},
Year = {2009},
date-added = {2019-08-16 10:28:23 +0200},
date-modified = {2019-08-16 10:28:23 +0200},
doi = {10.1007/978-3-642-03466-4_7}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A