{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:03Z","timestamp":1725485523370},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001416"},{"type":"electronic","value":"9783540361350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36135-9_3","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T22:43:21Z","timestamp":1180651401000},"page":"34-49","source":"Crossref","is-referenced-by-count":2,"title":["Congruent Weak Conformance, a Partial Order among Processes"],"prefix":"10.1007","author":[{"given":"Ronald W.","family":"Brower","sequence":"first","affiliation":[]},{"given":"Kenneth S.","family":"Stevens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-63166-6_34","volume-title":"Partial Order Reduction in Symbolic State Space Exploration","author":"R. Alur","year":"1997","unstructured":"Alur, R., Brayton, R.K., Henzinger, T.A., Qadeer, S, Rajamani, S.K.: Partial Order Reduction in Symbolic State Space Exploration. In: Proceedings of the Ninth International Conference on Computer-aided Verification (CAV 1997), Lecture Notes in Computer Science, Vol. 1254, Berlin Heidelberg New York (1997) 340\u2013351"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S. Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy. M.: An Efficiency Preorder for Processes. Acta Informatica, Vol. 29 (1992) 737\u201376","journal-title":"Acta Informatica"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S., Natajaran, V.: Conformance: A Precongruence Close to Bisimilarity. In: Desel, J. (ed.): International Workshop on Structures in Concurrency Theory (STRICT\u2019 95). Workshops in Computing, Springer-Verlag, Berlin Heidelberg New York (1995) 55\u201368.","DOI":"10.1007\/978-1-4471-3078-9_4"},{"issue":"1","key":"3_CR4","first-page":"232","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S. Meyer, A.R.: Bisimulation Can\u2019t Be Traced. In: Journal of the ACM. Vol. 42. No.1. (January 1995) 232\u2013268","journal-title":"Bisimulation Can\u2019t Be Traced. In: Journal of the ACM"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A Theory of Communicating Sequential Processes. In: Journal of the ACM, Vol. 31. No. 3. (1984) 560\u2013599","journal-title":"Journal of the ACM"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s002360050107","volume":"34","author":"F. Corradini","year":"1997","unstructured":"Corradini, F., Gorrieri, R., Roccetti, M.: Performance Preorder and Competitive Equivalence. In: Acta Informatica, Vol. 34. (1997)805\u2013835","journal-title":"Acta Informatica"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(99)80003-6","volume":"216","author":"P. Degano","year":"1999","unstructured":"Degano, P., Priami, C.: Non-interleaving Semantics for Mobile Processes. In: Theoretical Computer Science, Vol. 216. (1999) 237\u2013270","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing Equivalences for Processes. In: Theoretical Computer Science, Vol. 34. (1984) 83\u2013133","journal-title":"Theoretical Computer Science"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P. Partial Order Methods for the Verification of Concurrent Systems. Doctoral Thesis. University of Liege. (1995)","DOI":"10.1007\/3-540-60761-7"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J. F. Groote","year":"1992","unstructured":"Groote, J. F., Vaandrager, F.: Structured Operational Semantics and Bisimulation as a Congruence. In: Information and Computation, Vol. 100. (1992) 202\u2013260","journal-title":"Information and Computation"},{"key":"3_CR11","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge, Mass. (1988)"},{"issue":"1","key":"3_CR12","doi-asserted-by":"crossref","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. In: Journal of the Association of Computing Machinery, Vol. 32, No. 1. (1985) 137\u2013161","journal-title":"Journal of the Association of Computing Machinery"},{"key":"3_CR13","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. In: (McKeag, R.M., Macnaghten, A.M. (eds.): On the Construction of Programs-an Advanced Course. Cambridge University Press. (1980) 229\u2013254"},{"key":"3_CR14","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International, London (1985)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Ing\u00f3lfsd\u00f3ttir, A., Schalk, A.: A Fully Abstract Denotational Model for Observational Congruence. Basic Research in Computer Science Report BRICS-RS-95-40 (August 1995)","DOI":"10.7146\/brics.v2i40.19942"},{"key":"3_CR16","volume-title":"IEEE Standard VHDL Language Reference Manual","author":"Institute of Electrical and Electronics Engineers","year":"1993","unstructured":"Institute of Electrical and Electronics Engineers, IEEE Standard VHDL Language Reference Manual. IEEE Press, New York (1993)"},{"key":"3_CR17","series-title":"ICASE Report","volume-title":"A Faster-than Relation for Asynchronous Processes","author":"G. L\u00fcttgen","year":"2001","unstructured":"L\u00fcttgen, G., Vogler, W.: A Faster-than Relation for Asynchronous Processes. ICASE Report No. 2001-2. NASA Langley Research Center, Hampton, Virginia (January 2001)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for Synchrony and Asynchrony. In: Theoretical Computer Science, Vol. 25 (1983) 267\u2013310","journal-title":"Theoretical Computer Science"},{"key":"3_CR19","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, New York, London (1989)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.R. Olderog","year":"1986","unstructured":"Olderog, E.R., Hoare, C.A.R.: Specification-oriented Semantics for Communicating Processes. In: Acta Informatica, Vol. 23. (1986) 9\u201366","journal-title":"Acta Informatica"},{"key":"3_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Concurrency and Automata on Infinite Processes","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and Automata on Infinite Processes. In: Deussen P. (ed.): Proceedings 5th GI Conference. Lecture Notes in Computer Science, Vol. 104. Springer-Verlag, Berlin Heidelberg New York (1981) 167\u2013183"},{"key":"3_CR22","first-page":"241","volume":"50","author":"I.C.C. Phillips","year":"1987","unstructured":"Phillips, I.C.C.: Refusal Testing. In: Theoretical Computer Science, Vol. 50 (1987) 241\u2013284","journal-title":"Refusal Testing. In: Theoretical Computer Science"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Rounds, W.C., Brookes, S.D.: Possible Futures, Acceptances, Refusals and Communicating Processes. In: Proceedings 22nd Annual Symposium on Foundations of Computer Science. IEEE, New York (1981) 140\u2013149","DOI":"10.1109\/SFCS.1981.36"},{"key":"3_CR24","unstructured":"Segala, Roberto.: A Process Algebraic View of I\/O Automata. MS Thesis. Massachusetts Institute of Technology, Cambridge, Mass. (1994)"},{"key":"3_CR25","unstructured":"Stevens, K.S.: Practical Verification and Synthesis of Low Latency Asynchronous Systems. Doctoral Dissertation. University of Calgary. Calgary, Alberta, Canada (1994)"},{"key":"3_CR26","series-title":"Lect Notes Comput Sci","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The Linear Time-Branching Time Spectrum II. In: CONCUR\u201993. Lecture Notes in Computer Science, Vol. 715. Springer-Verlag, Berlin Heidelberg New York (1993)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Sytems \u2014 FORTE 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36135-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:17:33Z","timestamp":1556450253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36135-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001416","9783540361350"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-36135-9_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}