{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:47Z","timestamp":1725664967364},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631415"},{"type":"electronic","value":"9783540691884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:05Z","timestamp":1330297745000},"page":"288-301","source":"Crossref","is-referenced-by-count":3,"title":["High level expressions with their SOS semantics"],"prefix":"10.1007","author":[{"given":"Hanna","family":"Klaudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert-C.","family":"Riemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"J. Baeten and W.P. Weijland. Process Algebras. Cambridge Tracts in Theoretical Computer Science 18, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"E. Best, R. Devillers, and J.G. Hall. The Box Calculus: a New Causal Algebra with Multi-Label Communication. In G. Rozenberg, Ed., Advances in Petri Nets 92, Vol. 609 of Lecture Notes in Computer Science, pages 21\u201369. Springer, 1992.","DOI":"10.1007\/3-540-55610-9_167"},{"key":"20_CR3","unstructured":"E. Best, R. Devillers, and M. Koutny. Petri Net Algebra. Book draft, 1997."},{"key":"20_CR4","unstructured":"E. Best and H. Fleischhack, Eds. PEP: Programming Environment Based on Petri Nets. Number 14\/95 in Hildesheimer Informatik-Berichte. Universiti\u00e4t Hildesheim, May 1995."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. In Michelis and Diaz, Eds., Application and Theory of Petri Nets 1995, Vol. 935 of Lecture Notes in Computer Science. Springer, June 1995.","DOI":"10.1007\/3-540-60029-9_36"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. An M-Net Semantics of B(PN) 2. In STRICT, WiC. Springer, 1995.","DOI":"10.1007\/978-1-4471-3078-9_6"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"E. Best and R.P. Hopkins. B(PN)2 \u2014 a Basic Petri Net Programming Notation. In A. Bode, M. Reeve, and G. Wolf, Eds., Proceedings of PARLE '93, Vol. 694 of Lecture Notes in Computer Science, pages 379\u2013390. Springer, 1993.","DOI":"10.1007\/3-540-56891-3_30"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"E. Best and M. Koutny. A Refined View of the Box Algebra. In Michelis and Diaz, Eds., Application and Theory of Petri Nets 1995, Vol. 935 of Lecture Notes in Computer Science, pages 1\u201320. Springer, June 1995.","DOI":"10.1007\/3-540-60029-9_29"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall (1985).","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"20_CR10","unstructured":"H. Klaudel and R.-C. Riemann. M-expressions \u2014 a High Level Process Algebra with an Application to a Parallel Programming Language. LRI, Universit\u00e9 Paris-Sud, Rapport 1090, January 1997. (http:\/\/www.lri.fr\/\u223crobert\/work.html)."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"M. Koutny, J. Esparza, and E. Best. Operational Semantics for the Petri Box Calculus. In B. Jonsson and J. Parrow, Eds., CONCUR'94: Concurrency Theory, Vol. 836 of Lecture Notes in Computer Science, pages 210\u2013225. Springer, 1994.","DOI":"10.1007\/978-3-540-48654-1_19"},{"key":"20_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"20_CR13","unstructured":"G.D. Plotkin. A Structural Approach to Operational Semantics. Report DAIMI FN-19, Aarhus University, Computer Science Departement, September 1981."}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:34:52Z","timestamp":1640950492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}