{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:52Z","timestamp":1761597052086},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677154"},{"type":"electronic","value":"9783540450221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_62","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:57:25Z","timestamp":1194980245000},"page":"744-755","source":"Crossref","is-referenced-by-count":9,"title":["A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors"],"prefix":"10.1007","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"issue":"2","key":"62_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0304-3975(91)90231-P","volume":"82","author":"E. Badouel","year":"1991","unstructured":"E. Badouel, P. Darondeau, \u201cOn Guarded Recursion\u201d, in Theoretical Computer Science 82(2):403\u2013408, 1991","journal-title":"Theoretical Computer Science"},{"key":"62_CR2","volume-title":"Technical Report UBLCS-99-18","author":"M. Bravetti","year":"1999","unstructured":"M. Bravetti, R. Gorrieri, \u201cA Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors\u201d, Technical Report UBLCS-99-18, University of Bologna (Italy), 1999"},{"key":"62_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-61604-7_46","volume-title":"Proc. of the 7th Int. Conf. on Concurrency Theory (CONCUR\u2019 96)","author":"R. Cleaveland","year":"1996","unstructured":"R. Cleaveland, G. Luttgen, V. Natarajan, \u201cA Process Algebra with Distributed Priorities\u201d, in Proc. of the 7th Int. Conf. on Concurrency Theory (CONCUR\u2019 96), LNCS 1119:34\u201349, 1996"},{"key":"62_CR4","volume-title":"Priority in Process Algebras","author":"R. Cleaveland","year":"2000","unstructured":"R. Cleaveland, G. Luttgen, V. Natarajan, \u201cPriority in Process Algebras\u201d, to appear in Handbook of Process Algebra, Elsevier, 2000"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","volume":"87","author":"R. Cleaveland","year":"1990","unstructured":"R. Cleaveland, M. Hennessy, \u201cPriorities in Process Algebra\u201d, in Information and Computation 87:58\u201377, 1990","journal-title":"Information and Computation"},{"key":"62_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BFb0055626","volume-title":"Proc. of the 9th Int. Conf. on Concurrency Theory (CONCUR\u2019 98)","author":"H. Hermanns","year":"1998","unstructured":"H. Hermanns, M. Lohrey, \u201cPriority and Maximal Progress Are Completely Axiomatisable (Extended Abstract)\u201d, in Proc. of the 9th Int. Conf. on Concurrency Theory (CONCUR\u2019 98), LNCS 1466:237\u2013252, Nice (France), 1998"},{"unstructured":"H. Hermanns, M. Lohrey, \u201cObservational Congruence in a Stochastic Timed Calculus with Maximal Progress\u201d, Technical Report IMMD-VII\/7-97, Universit\u00e4t Erlangen-N\u00fcrnberg, 1997","key":"62_CR7"},{"unstructured":"R. Milner, \u201cCommunication and Concurrency\u201d, Prentice Hall, 1989.","key":"62_CR8"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R. Milner","year":"1989","unstructured":"R. Milner, \u201cA complete axiomatization for observational congruence of finitestate behaviours\u201d, in Information and Computation 81:227\u2013247, 1989","journal-title":"Information and Computation"},{"key":"62_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-58715-2_127","volume-title":"Proc. of Foundations of Software Technology and Theoretical Computer Science","author":"V. Natarajan","year":"1994","unstructured":"V. Natarajan, I. Christoff, L. Christoff, R. Cleaveland, \u201cPriorities and Abstraction in Process Algebra\u201d, in Proc. of Foundations of Software Technology and Theoretical Computer Science, LNCS 880:217\u2013230, 1994"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:12:25Z","timestamp":1551067945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_62","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}