{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:20Z","timestamp":1742600420983,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606307"},{"type":"electronic","value":"9783540485094"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60630-0_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:49:46Z","timestamp":1330289386000},"page":"195-215","source":"Crossref","is-referenced-by-count":4,"title":["Model checking of non-finite state processes by finite approximations"],"prefix":"10.1007","author":[{"given":"N.","family":"Francesco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Fantechi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Gnesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Inverardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J. C. M. Baeten","year":"1993","unstructured":"J. C. M. Baeten, J. A. Bergstra, J. W. Klop. Deddability of bisimulation equivalence for processes generating context-free languages. Journal of ACM 40, 3, 1993, pp. 653\u2013682.","journal-title":"Journal of ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"G. Bruns. A practical technique for process abstraction. CONCUR'93, LNCS 715, pp. 37\u201349.","DOI":"10.1007\/3-540-57208-2_4"},{"key":"10_CR3","first-page":"207","volume":"n. 54","author":"A. Bouali","year":"1994","unstructured":"A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment. Bulletin of the EATCS, n. 54, October 1994, pp. 207\u2013223.","journal-title":"Bulletin of the EATCS"},{"key":"10_CR4","first-page":"98","volume":"836","author":"O. Burkart","year":"1994","unstructured":"O. Burkart, B. Steffen. Pushdown processes: Parallel Composition and Model Checking. Proceedings, CONCUR 94, LNCS 836, 1994, pp. 98\u2013113.","journal-title":"Proceedings, CONCUR 94, LNCS"},{"issue":"2","key":"10_CR5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"E.M. Clarke, E.A. Emerson, A.P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications. ACM Toplas, 8 (2), 1986, pp. 244\u2013263.","journal-title":"ACM Toplas"},{"issue":"5","key":"10_CR6","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"E.M. Clarke, O. Grumberg, D.E. Long. Model Checking and Abstraction. ACM Toplas, 16 (5), 1994, pp. 1512\u20131542.","journal-title":"ACM Toplas"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, B. Steffen. The Concurrency Workbench. Proceedings of Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science 407, Springer-Verlag, 1990, pp. 24\u201337.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"10_CR8","unstructured":"D.Dams, O.Grumberg, R.Gerth. Automatic Verification of Abstract Interpretation of Reactive Systems: Abstractions Preserving \u2200CTL*, \u2203CTL*, CTL*. IFIP working conference on Programming Concepts, Methods and Calculi (PROCOMET'94), 1994."},{"issue":"1","key":"10_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01178922","volume":"31","author":"N. Francesco De","year":"1994","unstructured":"N. De Francesco, P. Inverardi. Proving Finiteness of CCS Processes by Non-standard Semantics. Acta Informatica, 31 (1), 1994, pp. 55\u201380.","journal-title":"Acta Informatica"},{"issue":"No.7","key":"10_CR10","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/0169-7552(93)90047-8","volume":"25","author":"R. Nicola De","year":"1993","unstructured":"R. De Nicola, A. Fantechi, S. Gnesi, G. Ristori. An action-based framework for verifying logical and behavioural properties of concurrent systems. Computer Network and ISDN systems, Vol. 25, No. 7, 1993, pp 761\u2013778.","journal-title":"Computer Network and ISDN systems"},{"key":"10_CR11","first-page":"407","volume":"469","author":"R. Nicola De","year":"1990","unstructured":"R. De Nicola, F. W. Vaandrager. Action versus State based Logics for Transition Systems. Proceedings Ecole de Printemps on Semantics of Concurrency. LNCS 469, 1990, pp. 407\u2013419.","journal-title":"LNCS"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J.C. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodriguez, J. Sifakis. A Toolbox for the Verification of LOTOS Programs. 14th ICSE, Melbourne, 1992, pp. 246\u2013261.","DOI":"10.1145\/143062.143124"},{"key":"10_CR13","unstructured":"J.C. Fernandez, L. Mounier. Verifying Bisimulations \u201cOn the Fly\u201d. Formal Description Techniques, III, Elsevier Science Publisher, pp. 95\u2013110, 1991."},{"key":"10_CR14","volume-title":"TAV Users Manual. Internal Report","author":"J. C. Godskesen","year":"1989","unstructured":"J. C. Godskesen, K. G. Larsen, M. Zeeberg. TAV Users Manual. Internal Report, Aalborg University Center, Denmark, 1989."},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 32, 1985, pp. 137\u2013161.","journal-title":"Journal of ACM"},{"key":"10_CR16","first-page":"593","volume":"700","author":"H. Hungar","year":"1993","unstructured":"H. Hungar, B. Steffen. Local Model Checking for Context-Free Processes. Proceedings, ICALP 93, LNCS 700, 1993, pp. 593\u2013605","journal-title":"LNCS"},{"key":"10_CR17","first-page":"114","volume":"836","author":"H. Hungar","year":"1994","unstructured":"H. Hungar. Local Model Checking for Parallel Composition of Context-Free Processes. Proceedings, CONCUR 94, LNCS 836, 1994, pp. 114\u2013128.","journal-title":"LNCS"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"H. Huttel, C Stirling. Actions speak louder than words: Proving Bisimilarity for Context Free Processes. LICS 91, IEEE Computer Society Press, 1991, pp. 376\u2013386.","DOI":"10.1109\/LICS.1991.151661"},{"key":"10_CR19","first-page":"268","volume":"53","author":"E. Kindler","year":"1994","unstructured":"E. Kindler. Safety and Liveness Properties: A Survey. Bulletin of the EATCS, 53, 1994, pp. 268\u2013272.","journal-title":"Bulletin of the EATCS"},{"key":"10_CR20","first-page":"110","volume":"47","author":"E. Madelaine","year":"1992","unstructured":"E. Madelaine. Verification Tools from the Concur Project. Bulletin of EATCS 47, 1992, pp. 110\u2013120.","journal-title":"Bulletin of EATCS"},{"key":"10_CR21","unstructured":"E. Madelaine, D. Vergamini. AUTO: A Verification Tool for Distributed Systems Using Reduction of Finite Automata Networks. FORTE '89, North-Holland, 1990, pp. 61\u201366."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli. The Anchored Version of the Temporal Framework, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science 354, Springer-Verlag, 1989, pp. 201\u2013284.","DOI":"10.1007\/BFb0013024"},{"key":"10_CR23","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. LNCS 369, 1989.","DOI":"10.1007\/3-540-51525-9"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60630-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:07:38Z","timestamp":1742598458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60630-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606307","9783540485094"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60630-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}