{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:34:24Z","timestamp":1742358864874,"version":"3.40.1"},"publisher-location":"London","reference-count":17,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198222"},{"type":"electronic","value":"9781447132172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-1-4471-3217-2_4","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T17:40:09Z","timestamp":1326735609000},"page":"43-64","source":"Crossref","is-referenced-by-count":2,"title":["A Process Calculus with Incomparable Priorities"],"prefix":"10.1007","author":[{"given":"Hans","family":"Hansson","sequence":"first","affiliation":[]},{"given":"Fredrik","family":"Orava","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"L. Aceto. On relating concurrency and nondeterminism. In Proc. Chalmers Workshop on Concurrency, B\u00e5,stad, Sweden, May 1991. Also available as Technical Report 6\/89, University of Sussex, 1989."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1986-9202","volume":"9","author":"J Baeten","year":"1986","unstructured":"J. Baeten, J. Bergstra, and J. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fondamenta Informaticae, 9: 127\u2013168, 1986.","journal-title":"Fondamenta Informaticae"},{"key":"4_CR3","first-page":"411","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G Boudol","year":"1988","unstructured":"G. Boudol and I. Castellani. Permutation of transitions: An event structure semantics for CCS and SCCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 411\u2013427. Springer Verlag, 1988."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. In Proc. Chalmers Workshop on Concurrency, B\u00e5stad, Sweden, May 1991. Also available as Technical Report 4\/91, University of Sussex, 1991.","DOI":"10.1007\/3-540-54345-7_52"},{"key":"4_CR5","first-page":"142","volume-title":"Proc. CONCUR91 2nd International Conference on Concurrency Theory","author":"J Camilleri","year":"1991","unstructured":"J. Camilleri. A conditional operator for CCS. In J. Baeten and J.-F. Groote, editors, Proc. CONCUR\u201991 2 nd International Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science, pages 142\u2013156. Springer Verlag, August 1991."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and M. Hennessy. Priorities in process algebra. In Proc. 3 rd IEEE Int. Symp. on Logic in Computer Science, pages 193\u2013202. IEEE Computer Society Press, 1988.","DOI":"10.1109\/LICS.1988.5118"},{"key":"4_CR7","unstructured":"J. Camilleri and G. Winskel. CCS with priority choice. In Proc. 6 th , IEEE Int. Symp. on Logic in Computer Science. IEEE Computer Society Press, July 1991."},{"key":"4_CR8","first-page":"438","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"P Degano","year":"1988","unstructured":"P. Degano, R. De Nicola, and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 438\u2013466. Springer Verlag, 1988."},{"key":"4_CR9","first-page":"29","volume-title":"TAPSOFT\u201991","author":"G Ferrari","year":"1991","unstructured":"G. Ferrari, R. Gorrieri, and U. Montanari. An extended expansion theorem. In S. Abramsky and T.S.E Mailbaum, editors, TAPSOFT\u201991, volume 494 of Lecture Notes in Computer Science, pages 29\u201348. Springer Verlag, 1991."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BFb0039065","volume-title":"Proc. CONCUR\u201990 Theories of Concurrency: Unification and Extension","author":"R Gerber","year":"1990","unstructured":"R. Gerber and I. Lee. CCSR: a calculus for communicating shared resources. In J.C.M. Baeten and J.W. Klop, editors, Proc. CONCUR\u201990 Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 263\u2013277. Springer Verlag, 1990."},{"key":"4_CR11","unstructured":"H. Hansson and F. Orava. A calculus with incomparable priorities. Technical report, Swedish Institute of Computer Science. In preparation."},{"key":"4_CR12","first-page":"493","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A Jeffrey","year":"1992","unstructured":"A. Jeffrey. Translating timed process algebra into prioritized process algebra. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lecture Notes in Computer Science, pages 493\u2013506. Springer Verlag, 1992."},{"key":"4_CR13","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, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980."},{"key":"4_CR14","volume-title":"Communication and Concurrency. Prentice-Hall","author":"R Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"4_CR15","volume-title":"A structural approach to operational semantics. Technical report, DAIMI FN-19","author":"G Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical report, DAIMI FN-19, Dept. of Computer Science, Aarhus University, Aarhus, Denmark, 1981."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/BFb0039077","volume-title":"Proc. CONCUR\u201990 Theories of Concurrency: Unification and Extension","author":"S Smolka","year":"1990","unstructured":"S. Smolka and B. Steffen. Priority as extremal probability. In J.C.M. Baeten and J.W. Klop, editors, Proc. CONCUR\u201990 Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 456\u2013466. Springer Verlag, 1990."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BFb0039078","volume-title":"Proc. CONCUR\u201990 Theories of Concurrency: Unification and Extension","author":"C Tofts","year":"1990","unstructured":"C. Tofts. A synchronous calculus of relative frequency. In J.C.M. Baeten and J.W. Klop, editors, Proc. CONCUR\u201990 Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 467\u2013480. Springer Verlag, 1990."}],"container-title":["Workshops in Computing","NAPAW 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3217-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T21:51:47Z","timestamp":1742334707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3217-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540198222","9781447132172"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3217-2_4","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1993]]}}}