{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:11:24Z","timestamp":1740287484330,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407539"},{"type":"electronic","value":"9783540451877"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_5","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T22:38:49Z","timestamp":1277505529000},"page":"72-86","source":"Crossref","is-referenced-by-count":2,"title":["Syntactic Formats for Free"],"prefix":"10.1007","author":[{"given":"Bartek","family":"Klin","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0960129500000189","volume":"3","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Vickers, S.: Quantales, observational logic and process semantics. Math. Struct. in Comp. Sci.\u00a03, 161\u2013227 (1993)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"5_CR2","volume-title":"Handbook of Process Algebra","author":"L. Aceto","year":"1999","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, Elsevier, Amsterdam (1999)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theoretical Computer Science\u00a0114, 299\u2013315 (1993)","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01215409","volume":"6","author":"B. Bloom","year":"1994","unstructured":"Bloom, B.: When is partial trace equivalence adequate? Formal Aspects of Computing\u00a06, 25\u201368 (1994)","journal-title":"Formal Aspects of Computing"},{"doi-asserted-by":"crossref","unstructured":"Bloom, B., Fokkink, W., van Glabbeek, R.J.: Precongruence formats for decorated trace preorders. In: Logic in Computer Science, pp. 107\u2013118 (2000)","key":"5_CR6","DOI":"10.1109\/LICS.2000.855760"},{"unstructured":"Bloom, B., Fokkink, W.J., van Glabbeek, R.J.: Precongruence formats for decorated trace semantics. ACM Transactions on Computational Logic (to appear)","key":"5_CR7"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.: Bisimulation can\u2019t be traced. Journal of the ACM\u00a042, 232\u2013268 (1995)","journal-title":"Journal of the ACM"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0030","volume":"126","author":"W. Fokkink","year":"1996","unstructured":"Fokkink, W., van Glabbeek, R.: Ntyft\/ntyxt rules reduce to ntree rules. Information and Computation\u00a0126, 1\u201310 (1996)","journal-title":"Information and Computation"},{"key":"5_CR10","volume-title":"Handbook of Process Algebra","author":"R.J. Glabbeek van","year":"1999","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum I. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra. Elsevier, Amsterdam (1999)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"Groote, J.F.: Transition system specifications with negative premises. Theoret. Comput. Sci.\u00a0118, 263\u2013299 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR12","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 the ACM\u00a032, 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"5_CR13","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0141. North Holland, Elsevier (1999)","key":"5_CR14"},{"doi-asserted-by":"crossref","unstructured":"Klin, B., Soboci\u0144ski, P.: Syntactic formats for free: An abstract approach to process equivalence. BRICS Report RS-03-18, Aarhus University (2003), Available from http:\/\/www.brics.dk\/RS\/03\/18\/BRICS-RS-03-18.pdf","key":"5_CR15","DOI":"10.7146\/brics.v10i18.21788"},{"key":"5_CR16","volume-title":"Categories for the Working Matematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Matematician. Springer, Heidelberg (1998)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M. Park","year":"1981","unstructured":"Park, D.M.: Concurrency on automata and infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104. Springer, Heidelberg (1981)"},{"unstructured":"Plotkin, G.: A structural approach to operational semantics. DAIMI Report FN-19, Computer Science Department, Aarhus University (1981)","key":"5_CR18"},{"key":"5_CR19","volume-title":"Electronic Notes in Theoretical Computer Science","author":"G. Plotkin","year":"2001","unstructured":"Plotkin, G.: Bialgebraic semantics and recursion (extended abstract). In: Corradini, A., Lenisa, M., Montanari, U. (eds.) Electronic Notes in Theoretical Computer Science, vol.\u00a044. Elsevier Science Publishers, Amsterdam (2001)"},{"doi-asserted-by":"crossref","unstructured":"Plotkin, G.: Bialgebraic semantics and recursion. In: Invited talk, Workshop on Coalgebraic Methods in Computer Science, Genova (2001)","key":"5_CR20","DOI":"10.1016\/S1571-0661(04)80914-9"},{"key":"5_CR21","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall, Englewood Cliffs (1997)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/3-540-58043-3_28","volume-title":"A Decade of Concurrency","author":"J. Rutten","year":"1994","unstructured":"Rutten, J., Turi, D.: Initial algebra and final coalgebra semantics for concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol.\u00a0803, pp. 530\u2013582. Springer, Heidelberg (1994)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theoret. Comput. Sci.\u00a037, 245\u2013267 (1985)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Turi, D.: Fibrations and bisimulation (unpublished notes)","key":"5_CR24"},{"unstructured":"Turi, D.: Functorial Operational Semantics and its Denotational Dual. PhD thesis, Vrije Universiteit, Amsterdam (1996)","key":"5_CR25"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/LICS.1997.614955","volume-title":"Proceedings 12th Ann. IEEE Symp. on Logic in Computer Science, LICS 1997","author":"D. Turi","year":"1997","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proceedings 12th Ann. IEEE Symp. on Logic in Computer Science, LICS 1997, Warsaw, Poland, June 29 \u2013 July 2, pp. 280\u2013291. IEEE Computer Society Press, Los Alamitos (1997)"},{"doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W.: On the relationship between process algebra and input\/output automata. In: Logic in Computer Science, pp. 387\u2013398 (1991)","key":"5_CR27","DOI":"10.1109\/LICS.1991.151662"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T07:57:33Z","timestamp":1740211053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_5"}},"subtitle":["An Abstract Approach to Process Equivalence"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}