{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:45:51Z","timestamp":1768002351093,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540744061","type":"print"},{"value":"9783540744078","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_8","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"105-119","source":"Crossref","is-referenced-by-count":33,"title":["On Modal Refinement and Consistency"],"prefix":"10.1007","author":[{"given":"Kim G.","family":"Larsen","sequence":"first","affiliation":[]},{"given":"Ulrik","family":"Nyman","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"W\u0105sowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"LICS","author":"K.G. Larsen","year":"1988","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"M. Huth","year":"2001","unstructured":"Huth, M., Jagadeesan, R., Schmidt, D.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001 and ETAPS 2001. LNCS, vol.\u00a02028, Springer, Heidelberg (2001)"},{"key":"8_CR3","unstructured":"Schmidt, D.: From trace sets to modal-transition systems by stepwise abstract interpretation (2001)"},{"key":"8_CR4","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, p. 426. Springer, Heidelberg (2001)"},{"key":"8_CR5","first-page":"449","volume-title":"FORTE 1992 Proceedings","author":"A. B\u00f8rjesson","year":"1993","unstructured":"B\u00f8rjesson, A., Larsen, K.G., Skou, A.: Generality in design and compositional verification using tav. In: FORTE 1992 Proceedings, The Netherlands, pp. 449\u2013464. North-Holland Publishing Co., Amsterdam (1993)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Steffen, B., Weise, C.: A constraint oriented proof methodology based on modal transition systems. In: Tools and Algorithms for Construction and Analysis of Systems, pp. 17\u201340 (1995)","DOI":"10.1007\/3-540-60630-0_2"},{"issue":"1-2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00027-5","volume":"29","author":"G. Bruns","year":"1997","unstructured":"Bruns, G.: An industrial application of modal process logic. Sci. Comput. Program.\u00a029(1-2), 3\u201322 (1997)","journal-title":"Sci. Comput. Program."},{"key":"8_CR8","first-page":"108","volume-title":"LICS","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: LICS. Fifth Annual IEEE Symposium on Logics in Computer Science, Philadelphia, PA, USA, 4\u20137 June 1990, pp. 108\u2013117. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"ESOP 2007","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal i\/o automata for interface and product line theories. In: Nicola, R.D. (ed.) ESOP 2007. Programming Languages and Systems. LNCS, vol.\u00a04421, pp. 64\u201379. Springer, Heidelberg (2007)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1147249.1147254","volume-title":"ROSATEA 2006 Proceedings","author":"D. Fischbein","year":"2006","unstructured":"Fischbein, D., Uchitel, S., Braberman, V.: A foundation for behavioural conformance in software product line architectures. In: ROSATEA 2006 Proceedings, pp. 39\u201348. ACM Press, New York (2006)"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1029894.1029904","volume-title":"SIGSOFT FSE","author":"S. Uchitel","year":"2004","unstructured":"Uchitel, S., Chechik, M.: Merging partial behavioural models. In: Taylor, R.N., Dwyer, M.B. (eds.) SIGSOFT FSE, pp. 43\u201352. ACM Press, New York (2004)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11813040_8","volume-title":"FM 2006: Formal Methods","author":"G. Brunet","year":"2006","unstructured":"Brunet, G., Chechik, M., Uchitel, S.: Properties of behavioural model merging. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 98\u2013114. Springer, Heidelberg (2006)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/BFb0014735","volume-title":"Hybrid and Real-Time Systems","author":"C. Weise","year":"1997","unstructured":"Weise, C., Lenzkes, D.: Weak refinement for modal hybrid systems. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 316\u2013330. Springer, Heidelberg (1997)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal specifications. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-56922-7_21","volume-title":"Computer Aided Verification","author":"K. Cerans","year":"1993","unstructured":"Cerans, K., Godskesen, J.C., Larsen, K.G.: Timed modal specification - theory and tools. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 253\u2013267. Springer, Heidelberg (1993)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/BFb0020979","volume-title":"Hybrid Systems III","author":"K.G. Larsen","year":"1996","unstructured":"Larsen, K.G., Steffen, B., Weise, C.: Fischer\u2019s protocol revisited: a simple proof using modal constraints. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) Hybrid Systems III. LNCS, vol.\u00a01066, pp. 604\u2013615. Springer, Heidelberg (1996)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11901914_25","volume-title":"Automated Technology for Verification and Analysis","author":"H. Fecher","year":"2006","unstructured":"Fecher, H., Huth, M.: Ranked predicate abstraction for branching time: Complete incremental, and precise. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 322\u2013336. Springer, Heidelberg (2006)"},{"key":"8_CR18","unstructured":"Schmidt, H., Fecher, H.: Comparing disjunctive modal transition systems with a one-selecting variant (submitted for publication) (2007)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H., Larsen, K.G.: The use of static constructs in a modal process logic. In: LFCS. The 1st International Symposium on Logical Foundations of Computer Science (1989)","DOI":"10.1007\/3-540-51237-3_14"},{"key":"8_CR20","unstructured":"Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology (July 1996)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Henessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 137\u2013161 (1985)","DOI":"10.1145\/2455.2460"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Larsen, K.G.: A context dependent bisimulation between processes. Theoretical Computer Science\u00a049 (1987)","DOI":"10.1016\/0304-3975(87)90007-7"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Proceedings of 5th GI Conference, vol.\u00a0104 (1981)","DOI":"10.1007\/BFb0017309"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science\u00a025 (1983)","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45657-0_11","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"2002","unstructured":"Godefroid, P., Jagadeesan, R.: Automatic abstraction using generalized model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 137\u2013150. Springer, Heidelberg (2002)"},{"key":"8_CR26","unstructured":"H\u00fcttel, H.: Operational and denotational properties of modal process logic. Master\u2019s thesis, Computer Science Department. Aalborg University (1988)"},{"key":"8_CR27","unstructured":"Xinxin, L.: Specification and Decomposition in Concurrency. PhD thesis, Department of Mathematics and Comnputer Science, Aalborg University (April 1992)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Alfaro, L., Henzinger, T.A.: Interface automata. In: FSE. Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering, Vienna, Austria, pp. 109\u2013120 (september 2001)","DOI":"10.1145\/503209.503226"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T20:57:45Z","timestamp":1684011465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}