{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:50:29Z","timestamp":1778298629239,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540411963","type":"print"},{"value":"9783540409113","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40911-4_19","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:23:29Z","timestamp":1192785809000},"page":"318-337","source":"Crossref","is-referenced-by-count":5,"title":["A Concurrent and Compositional Petri Net Semantics of Preemption"],"prefix":"10.1007","author":[{"given":"Hanna","family":"Klaudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Pommereau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"19_CR1","unstructured":"G. Berry. The Foundations of Esterel. Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, editors, MIT Press, 1998."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-56503-5_16","volume-title":"General refinement and recursion operators for the Petri box calculus","author":"E. Best","year":"1993","unstructured":"E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. LNCS 665:130\u2013140, 1993."},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-55610-9_167","volume-title":"The box calculus: a new causal algebra with multi-label communication","author":"E. Best","year":"1992","unstructured":"E. Best, R. Devillers, and J. G. Hall. The box calculus: a new causal algebra with multi-label communication. LNCS 609:21\u201369, 1992."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"E. Best, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages. Acta Informatica, 35, 1998.","DOI":"10.1007\/s002360050144"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-56891-3_30","volume-title":"PARLE\u201993","author":"E. Best","year":"1993","unstructured":"E. Best and R. P. Hopkins. B(PN)2 \u2014 A basic Petri net programming notation. PARLE\u201993, LNCS 694:379\u2013390, 1993."},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(92)90184-H","volume":"96","author":"E. Best","year":"1992","unstructured":"E. Best and M. Koutny. Petri net semantics of priority systems. Theoretical Computer Science, 96(1):175\u2013215, 1992.","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"E. Best and H. Wimmel. Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets. ICATPN\u20192000, to appear.","DOI":"10.1007\/3-540-44988-4_6"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BFb0058038","volume-title":"FST&TCS\u201997","author":"R. Devillers","year":"1997","unstructured":"R. Devillers, H. Klaudel, and R.-C Riemann. General refinement for high-level Petri nets. FST&TCS\u201997, LNCS 1346:297\u2013311, 1997."},{"key":"19_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-10001-6_22","volume-title":"Net Theory and Applications","author":"H. J. Genrich","year":"1980","unstructured":"H. J. Genrich, K. Lautenbach, and P.S. Thiagarajan. Elements of General Net Theory. In W. Brauer, editor, Net Theory and Applications, Proceedings of the Advanced Course on General Net Theory of Processes and Systems, LNCS 84:21\u2013163, 1980."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"R. Devillers, H. Klaudel, and R.-C. Riemann. General parameterised refinement and recursion for the M-net calculus. Theoretical Computer Science, to appear.","DOI":"10.1016\/S0304-3975(02)00088-9"},{"issue":"2-3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2-3):151\u2013195, 1994.","journal-title":"Science of Computer Programming"},{"key":"19_CR12","unstructured":"H. Fleishhack and B. Grahlmann. A Petri net semantics for B(PN)2 with procedures. PDSE\u201997, Boston, 1997. IEEE Computer Society."},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","volume-title":"PEP-more than a Petri net tool","author":"B. Grahlmann","year":"1996","unstructured":"B. Grahlmann and E. Best. PEP-more than a Petri net tool. LNCS1055, 1996."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4757-2231-4"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"H. Klaudel. Compositional high-level Petri net semantics of a parallel programming language with procedures. Science of Computer Programming, to appear.","DOI":"10.1016\/S0167-6423(01)00004-1"},{"key":"19_CR16","unstructured":"H. Klaudel. Parametrized M-expression semantics of parallel procedures. DAP-SYS\u201900, to appear."},{"key":"19_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-46674-6_17","volume-title":"ASIAN\u201999","author":"H. Klaudel","year":"1999","unstructured":"H. Klaudel and F. Pommereau. Asynchronous links in the PBC and M-nets. ASIAN\u201999, LNCS 1742:190\u2013200, 1999."},{"key":"19_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-63141-0_20","volume-title":"CONCUR\u201997","author":"H. Klaudel","year":"1997","unstructured":"H. Klaudel and R.-C. Riemann. High level expressions with their SOS semantics. CONCUR\u201997, LNCS 1243:288\u2013301, 1997."},{"key":"19_CR19","unstructured":"H. Klaudel and R.-C. Riemann. Refinement-based semantics od parallel procedures. PDPTA\u201999, volume 4. CSREA Press, 1999."},{"key":"19_CR20","unstructured":"J. Lilius and E. Pelz. An M-net semantics of B(PN)2 with procedures. ISCIS, volume 1, 1996."},{"key":"19_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A calculus of communicating systems","author":"R. Milner","year":"1980","unstructured":"R. Milner. A calculus of communicating systems. LNCS 92, 1980."},{"key":"19_CR22","unstructured":"T. Vesper and M. Weber. Automatishes verteiltes r\u00fcchksetzen. In K. Spies and B. Sch\u00e4tz, editors, Proceedings of the workshop \u201cFormale Beschreibungstechniken f\u00fcr verteilte Systeme\u201d, number 9 in GI\/ITG Fachgespr\u00e4ch, Munich, 1999."},{"key":"19_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-63139-9_44","volume-title":"ICATPN\u201997","author":"M. Kishinevsky","year":"1997","unstructured":"M. Kishinevsky, J. Cortadella, A. Kondratyev, L. Lavagno, A. Taubin and A. Ya-kovlev. Coupling asynchrony and interrupts: place chart nets and their synthesis. ICATPN\u201997, LNCS1248:328\u2013347, 1997."}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40911-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T08:49:53Z","timestamp":1550998193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40911-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411963","9783540409113"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-40911-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}