{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:41Z","timestamp":1759638521591},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034657"},{"type":"electronic","value":"9783642034664"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03466-4_7","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T03:20:54Z","timestamp":1249269654000},"page":"112-126","source":"Crossref","is-referenced-by-count":18,"title":["Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete"],"prefix":"10.1007","author":[{"given":"Nikola","family":"Bene\u0161","sequence":"first","affiliation":[]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: 20 years of modal and mixed specifications. Bulletin of the EATCS 1995, 94\u2013129 (2008)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-78499-9_9","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Antonik","year":"2008","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: Complexity of decision problems for mixed and modal specifications. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 112\u2013126. Springer, Heidelberg (2008)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: EXPTIME-complete decision problems for mixed and modal specifications. In: Proc. of EXPRESS 2008 (July 2008)","DOI":"10.1016\/j.entcs.2009.06.011"},{"issue":"6A","key":"7_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J.L. Balcazar","year":"1992","unstructured":"Balcazar, J.L., Gabarr\u00f3, J., Santha, M.: Deciding bisimilarity is P-complete. Formal aspects of computing\u00a04(6A), 638\u2013648 (1992)","journal-title":"Formal aspects of computing"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., Srba, J.: On determinism in modal transition systems. Theoretical Computer Science (to appear) (2008)","DOI":"10.1016\/j.tcs.2009.06.009"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., Srba, J.: Checking thorough refinement on modal transition systems is EXPTIME-complete. Technical report FIMU-RS-2009-03, Faculty of Informatics, Masaryk University, Brno (2009)","DOI":"10.1007\/978-3-642-03466-4_7"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-642-00982-2_13","volume-title":"LATA 2009","author":"N. Bertrand","year":"2009","unstructured":"Bertrand, N., Pinchinat, S., Raclet, J.-B.: Refinement and consistency of timed modal specifications. In: Dediu, A.H., Lonescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 152\u2013163. Springer, Heidelberg (2009)"},{"key":"7_CR8","first-page":"475","volume-title":"Proc. of ASE 2008","author":"N. D\u2019Ippolito","year":"2008","unstructured":"D\u2019Ippolito, N., Fischbein, D., Chechik, M., Uchitel, S.: MTSA: The modal transition system analyser. In: Proc. of ASE 2008, pp. 475\u2013476. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"7_CR9","first-page":"6","volume-title":"Proc. of (ETX 2007)","author":"N. D\u2019Ippolito","year":"2007","unstructured":"D\u2019Ippolito, N., Fischbein, D., Foster, H., Uchitel, S.: MTSA: Eclipse support for modal transition systems construction, analysis and elaboration. In: Proc. of (ETX 2007), pp. 6\u201310. ACM Press, New York (2007)"},{"issue":"1-2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jlap.2008.05.003","volume":"77","author":"H. Fecher","year":"2008","unstructured":"Fecher, H., Schmidt, H.: Comparing disjunctive modal transition systems with an one-selecting variant. J. of Logic and Alg. Program.\u00a077(1-2), 20\u201339 (2008)","journal-title":"J. of Logic and Alg. Program."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-based model checking using modal transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 426\u2013440. Springer, Heidelberg (2001)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-45309-1_11","volume-title":"Programming Languages and Systems","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.A.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 155\u2013169. Springer, Heidelberg (2001)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-74407-8_8","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., Wasowski, A.: On modal refinement and consistency. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 105\u2013119. Springer, Heidelberg (2007)"},{"key":"7_CR14","first-page":"203","volume-title":"Proc. of LICS 1988","author":"K.G. Larsen","year":"1988","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: Proc. of LICS 1988, pp. 203\u2013210. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-69166-2_11","volume-title":"Static Analysis","author":"S. Nanz","year":"2008","unstructured":"Nanz, S., Nielson, F., Nielson, H.R.: Modal abstractions of concurrent behaviour. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol.\u00a05079, pp. 159\u2013173. Springer, Heidelberg (2008)"},{"key":"7_CR16","unstructured":"Raclet, J.-B.: Residual for component specifications. In: Proc. of the 4th International Workshop on Formal Aspects of Component Software (2007)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Passerone, R.: Why are modalities good for interface theories. In: Proc. of ACSD 2009 (to appear, 2009)","DOI":"10.1109\/ACSD.2009.22"},{"issue":"5","key":"7_CR18","first-page":"513","volume":"24","author":"Z. Sawa","year":"2005","unstructured":"Sawa, Z., Jan\u010dar, P.: Behavioural equivalences on finite-state systems are PTIME-hard. Computing and informatics\u00a024(5), 513\u2013528 (2005)","journal-title":"Computing and informatics"},{"key":"7_CR19","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Course Technology (2006)"},{"key":"7_CR20","first-page":"43","volume-title":"Proc. of FSE 2004","author":"S. Uchitel","year":"2004","unstructured":"Uchitel, S., Chechik, M.: Merging partial behavioural models. In: FSE 2004, pp. 43\u201352. ACM, New York (2004)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-93900-9_28","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Wei","year":"2009","unstructured":"Wei, O., Gurfinkel, A., Chechik, M.: Mixed transition systems revisited. In: Jones, N.D., M\u00fcller-Olm, M. (eds.) VMCAI 2009. LNCS, vol.\u00a05403, pp. 349\u2013365. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03466-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T04:13:38Z","timestamp":1633752818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03466-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034657","9783642034664"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03466-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}