{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:23Z","timestamp":1725488723302},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668367"},{"type":"electronic","value":"9783540466918"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46691-6_31","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T16:42:24Z","timestamp":1186677744000},"page":"381-393","source":"Crossref","is-referenced-by-count":4,"title":["Graded Modalities and Resource Bisimulation"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocco","family":"De Nicola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Labella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"key":"31_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0039053","volume-title":"Proc. Concur\u2019 90","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Process Algebra with a Zero Object. In Proc. Concur\u2019 90, LNCS 458, pp. 83\u201398, 1990. 383"},{"issue":"12","key":"31_CR2","first-page":"115","volume":"59","author":"M.C. Browne","year":"1998","unstructured":"Browne, M.C., Clarke, E., Gr\u00fcmberg O.: Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoretical Computer Science 59(1,2), pp. 115\u2013131, 1998. 381","journal-title":"Theoretical Computer Science"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Baeten, J., Weijland, P.: Process Algebras. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"31_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-60218-6_10","volume-title":"Proc. Concur\u201995","author":"F. Corradini","year":"1995","unstructured":"Corradini, F., De Nicola, R. and Labella, A.: Fully Abstract Models for Nondeterministic Regular Expressions. In Proc. Concur\u201995, LNCS 962, Springer Verlag, pp. 130\u2013144, 1995."},{"key":"31_CR5","unstructured":"Corradini, F., De Nicola, R. and Labella, A.: A Finite Axiomatization of Non deterministic Regular Expressions. Theoretical Informatics and Applications. To appear. Available from: ftp:\/\/rap.dsi.unifi.it\/pub\/papers\/FinAxNDRE . Abstract in FICS, Brno, 1998."},{"key":"31_CR6","unstructured":"Corradini, F., De Nicola, R. and Labella, A.: Models for Non deterministic Regular Expressions. Journal of Computer and System Sciences. To appear. Available from: ftp:\/\/rap.dsi.unifi.it\/pub\/papers\/NDRE . 381, 382, 383, 385, 391, 391"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications. ACM Toplas 8(2), pp. 244\u2013263, 1986. 381","journal-title":"ACM Toplas"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench. ACM Toplas 15(1), pp. 36\u201372, 1993. 381","journal-title":"ACM Toplas"},{"key":"31_CR9","unstructured":"D\u2019Agostino, G.: Modal Logics and non well-founded Set Theories: translation, bisimulation and interpolation. Thesis, Amsterdam, 1998. 391, 391"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R. Nicola De","year":"1987","unstructured":"De Nicola, R.: Extensional Equivalences for Transition Systems. Acta Informatica 24, pp. 211\u2013237, 1987. 381","journal-title":"Acta Informatica"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Labella, A.: Tree Morphisms and Bisimulations, Electronic Notes in TCS 18, 1998.","DOI":"10.1016\/S1571-0661(05)80249-X"},{"issue":"2","key":"31_CR12","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R. Nicola De","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.: Three Logics for Branching Bisimulation. Journal of ACM 42(2), pp. 458\u2013487, 1995. 381","journal-title":"Journal of ACM"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"E.H. Emerson","year":"1995","unstructured":"Emerson, E.H., Halpern, Y.: \u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time temporal logic. Journal of ACM 42, pp. 458\u2013487, 1995. 381","journal-title":"Journal of ACM"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00379767","volume":"44","author":"M. Fattorosi-Barnaba","year":"1985","unstructured":"Fattorosi-Barnaba, M., De Caro, F.: Graded Modalities, I. Studia Logica 44, pp. 197\u2013221, 1985. 382, 386","journal-title":"Studia Logica"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM 32, pp. 137\u2013161, 1985. 381, 386","journal-title":"Journal of ACM"},{"key":"31_CR16","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes, Prentice Hall, 1989."},{"key":"31_CR17","volume-title":"Comparative Concurrency Semantics and Refinement of Actions","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: Comparative Concurrency Semantics and Refinement of Actions. Ph.D. Thesis, Free University, Amsterdam, 1990. 381"},{"key":"31_CR18","unstructured":"Milner, R.: Communication and Concurrency, Prentice Hall, 1989. 389"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Manna, Z., and Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1992. 381","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"31_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proc. GI","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite sequences. In Proc. GI, LNCS 104, pp. 167\u2013183, 1981."},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A.: Two Complete Axiom Systems for the Algebra of Regular Events. Journal of ACM 13, pp. 158\u2013169, 1966. 382","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46691-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:58:20Z","timestamp":1556733500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46691-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668367","9783540466918"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46691-6_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}