{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:26:50Z","timestamp":1725470810959},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356332"},{"type":"electronic","value":"9783540356363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11784180_4","type":"book-chapter","created":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T14:12:21Z","timestamp":1159279941000},"page":"5-20","source":"Crossref","is-referenced-by-count":1,"title":["State Space Representation for Verification of Open Systems"],"prefix":"10.1007","author":[{"given":"Irem","family":"Aktug","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilian","family":"Gurov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/S0304-3975(02)00596-0","volume":"290","author":"F. Martinelli","year":"2003","unstructured":"Martinelli, F.: Analysis of security protocols as open systems. Theoretical Computer Science\u00a0290, 1057\u20131106 (2003)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Larsen, K.G.: Modal specifications. Automatic Verification Methods for Finite State Systems, 232\u2013246 (1989)","DOI":"10.1007\/3-540-52148-8_19"},{"key":"4_CR3","unstructured":"Aktug, I., Gurov, D.: Verification of open systems based on explicit state space representation. In: AVIS 2005: Proceedings of Automated Verification of Infinite Systems (to appear, 2005)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-56287-7_93","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Dam","year":"1992","unstructured":"Dam, M.: Fixed points of B\u00fcchi automata. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol.\u00a0652, pp. 39\u201350. Springer, Heidelberg (1992)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(94)00227-P","volume":"54","author":"R. Kaivola","year":"1995","unstructured":"Kaivola, R.: On modal mu-calculus and B\u00fcchi tree automata. Information Processing Letters\u00a054, 17\u201322 (1995)","journal-title":"Information Processing Letters"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"Grumberg, O., Long, D.: Model checking and modular verification. ACM Transactions on Programming Languages and Systems\u00a016(3), 843\u2013871 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/345099.345104","volume":"22","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.: An automata-theoretic approach to modular model checking. ACM Transactions on Programming Languages and Systems\u00a022, 87\u2013128 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR9","first-page":"211","volume-title":"Proc. MEMOCODE 2004","author":"C. Sprenger","year":"2004","unstructured":"Sprenger, C., Gurov, D., Huisman, M.: Compositional verification for secure loading of smart card applets. In: Heitmeyer, C., Talpin, J.P. (eds.) Proc. MEMOCODE 2004, pp. 211\u2013222. IEEE, Los Alamitos (2004)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/SFCS.1991.185392","volume-title":"Proceedings of 32nd Annual Symposium on Foundations of Computer Science","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of ACM\u00a047, 312\u2013360 (2000)","journal-title":"Journal of ACM"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-49213-5_7","volume-title":"Compositionality: The Significant Difference","author":"M. Dam","year":"1998","unstructured":"Dam, M., Fredlund, L., Gurov, D.: Toward parametric verification of open distributed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, pp. 150\u2013185. Springer, Heidelberg (1998)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46562-6_22","volume-title":"Perspectives of System Informatics","author":"M. Dam","year":"2000","unstructured":"Dam, M., Gurov, D.: Compositional verification of CCS processes. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol.\u00a01755, pp. 247\u2013256. Springer, Heidelberg (2000)"},{"key":"4_CR14","unstructured":"Christensen, S.: Decidability and Decomposition in Process Algebras. PhD thesis, University of Edinburgh (1993)"},{"key":"4_CR15","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 and ETAPS 2001. LNCS, vol.\u00a02028, pp. 155\u2013169. Springer, Heidelberg (2001)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-24730-2_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O. Grumberg","year":"2004","unstructured":"Grumberg, O., Shoham, S.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 546\u2013560. Springer, Heidelberg (2004)"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-16066-3_15","volume":"208","author":"A.W. Mostowski","year":"1984","unstructured":"Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. Computation Theory\u00a0208, 157\u2013168 (1984)","journal-title":"Computation Theory"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-46002-0_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Bustan","year":"2002","unstructured":"Bustan, D., Grumberg, O.: Applicability of fair simulation. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, pp. 401\u2013414. Springer, Heidelberg (2002)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Aktug, I., Gurov, D.: State space representation for verification of open systems. Technical report, KTH CSC (2006), http:\/\/www.nada.kth.se\/~irem\/sefros\/techrep06.ps","DOI":"10.1007\/11784180_4"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(92)90183-G","volume":"96","author":"J. Bradfield","year":"1992","unstructured":"Bradfield, J., Stirling, C.: Local model checking for infinite state spaces. Theoretical Computer Science\u00a096, 157\u2013174 (1992)","journal-title":"Theoretical Computer Science"},{"key":"4_CR21","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11784180_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:02Z","timestamp":1605643682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11784180_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356332","9783540356363"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11784180_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}