{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:09:34Z","timestamp":1725494974557},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653882"},{"type":"electronic","value":"9783540493662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49366-2_11","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:48:47Z","timestamp":1194979727000},"page":"125-141","source":"Crossref","is-referenced-by-count":1,"title":["Taxonomy and Expressiveness of Preemption: A Syntactic Approach"],"prefix":"10.1007","author":[{"given":"Sophie","family":"Pinchinat","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Rutten","sequence":"additional","affiliation":[]},{"given":"R. K.","family":"Shyamasundar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,30]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BFb0084799","volume-title":"Proc. CONCUR\u201992, Stony Brook, NY","author":"E. Badouel","year":"1992","unstructured":"E. Badouel and Ph. Darondeau. Structural operational specifications and trace automata. In Proc. CONCUR\u201992, Stony Brook, NY, LNCS 630, pages 302\u2013316. Springer-Verlag, August 1992."},{"key":"11_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-57529-4_44","volume-title":"Proc. FSTTCS\u201993, Bombay, India","author":"G. Berry","year":"1993","unstructured":"G. Berry. Preemption in concurrent systems. In Proc. FSTTCS\u201993, Bombay, India, LNCS 761, pages 72\u201393. Springer-Verlag, 1993."},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can\u2019t be traced. Journal of the ACM, 42(1):232\u2013268, January 1995.","journal-title":"Journal of the ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Research Report CS-R8845, CWI, November 1988.","DOI":"10.1007\/BFb0035774"},{"issue":"2","key":"11_CR5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J. F. Groote","year":"1992","unstructured":"J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202\u2013260, October 1992.","journal-title":"Information and Computation"},{"key":"11_CR6","series-title":"Lect Notes Comput Sci","first-page":"487","volume-title":"Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness, Mook","author":"K. G. Larsen","year":"1989","unstructured":"K. G. Larsen. Compositional theories based on an operational semantics of contexts. In Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness, Mook, LNCS 430, pages 487\u2013518. Springer-Verlag, May 1989."},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-10828-9_52","volume-title":"Proc. CAAP\u201981, Genoa","author":"R. Milner","year":"1981","unstructured":"R. Milner. A modal characterisation of observable machine-behaviour. In Proc. CAAP\u201981, Genoa, LNCS 112, pages 25\u201334. Springer-Verlag, March 1981."},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"23","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 23(3):267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_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. A complete axiomatisation for observational congruence of finitestate behaviours. Information and Computation, 81(2):227\u2013247, 1989.","journal-title":"Information and Computation"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pages 167\u2013183. Springer-Verlag, March 1981.","DOI":"10.1007\/BFb0017309"},{"key":"11_CR11","series-title":"Lect Notes Comput Sci","first-page":"293","volume-title":"Proc. 5th Workshop on Computer Science Logic, Bern","author":"S. Pinchinat","year":"1991","unstructured":"S. Pinchinat. Ordinal processes in comparative concurrency semantics. In Proc. 5th Workshop on Computer Science Logic, Bern, LNCS 626, pages 293\u2013305. Springer-Verlag, October 1991."},{"key":"11_CR12","volume-title":"Lect. Notes","author":"G. D. Plotkin","year":"1981","unstructured":"G. D. Plotkin. A structural approach to operational semantics. Lect. Notes, Aarhus University, Aarhus, DK, 1981."},{"key":"11_CR13","unstructured":"Special issue on Real-time systems designs and programming, Proceedings of the IEEE, volume 79, September 1991."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"A. Rensink. Bisimilarity of open terms. In Catuscia Palamidessi and Joachim Parrow, editors, Proc. EXPRESS\u2019 97: Expressiveness in Concurrency (Santa Margherita Ligure, Italy, September 8\u201312, 1997), volume 7 of entcs. Elesevier Science Publishers, 1997.","DOI":"10.1016\/S1571-0661(05)80477-3"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone De","year":"1985","unstructured":"R. De Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"key":"11_CR16","series-title":"Lect Notes Comput Sci","first-page":"111","volume-title":"In Algorithms, Concurrency and Knowledge, Proc. of the Asian Computing Science Conference, ACSC\u201995, Pathumthani, Thailand","author":"R.K. Shyamasundar","year":"1995","unstructured":"R.K. Shyamasundar S. Pinchinat, E. Rutten. Preemption in reactive laguages (a preliminary report). In In Algorithms, Concurrency and Knowledge, Proc. of the Asian Computing Science Conference, ACSC\u201995, Pathumthani, Thailand, LNCS 1023, pages 111\u2013125. Springer-Verlag, December 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science ASIAN 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49366-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:17:09Z","timestamp":1556965029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49366-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653882","9783540493662"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-49366-2_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}