{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:58Z","timestamp":1725664438551},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_127","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:41:31Z","timestamp":1330274491000},"page":"217-230","source":"Crossref","is-referenced-by-count":5,"title":["Priority and abstraction in process algebra"],"prefix":"10.1007","author":[{"given":"V.","family":"Natarajan","sequence":"first","affiliation":[]},{"given":"I.","family":"Christoff","sequence":"additional","affiliation":[]},{"given":"L.","family":"Christoff","sequence":"additional","affiliation":[]},{"given":"R.","family":"Cleaveland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","unstructured":"J. Baetan, J. Bergstra, and J. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CS-R8503, Department of Computer Science, University of Amsterdam, 1985."},{"volume-title":"Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science","year":"1990","key":"19_CR2","unstructured":"J. Baeten, editor. Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, England, 1990."},{"key":"19_CR3","volume-title":"Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science","author":"J. Baeten","year":"1990","unstructured":"J. Baeten and W. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, England, 1990."},{"key":"19_CR4","first-page":"481","volume-title":"The meaning of negative premises in transition system specification","author":"R. Bol","year":"1991","unstructured":"R. Bol and J. Groote. The meaning of negative premises in transition system specification. In Proceedings of the International Colloquium on Automata, Languages and Programming, pages 481\u2013494, Madrid, Spain, July 1991. Springer-Verlag."},{"key":"19_CR5","first-page":"417","volume-title":"CONCUR '93, volume 715 of Lecture Notes in Computer Science","author":"P. Br\u00e9monde-Gr\u00e9goire","year":"1993","unstructured":"P. Br\u00e9monde-Gr\u00e9goire, I. Lee, and R. Gerber. ACSR: An algebra of communicating shared resources with dense time and priorities. In CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 417\u2013431, Hildesheim, Germany, August 1993. Springer-Verlag."},{"key":"19_CR6","first-page":"246","volume-title":"CCS with priority choice","author":"J. Camilleri","year":"1991","unstructured":"J. Camilleri and G. Winskel. CCS with priority choice. In Proceedings of the Symposium on Logic in Computer Science, pages 246\u2013255, Amsterdam, July 1991. Computer Society Press."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"R. Cleaveland. Analyzing concurrent systems using the Concurrency Workbench. In P. Lauer, editor, Functional Programming, Concurrency, Simulation and Automated Reasoning, volume 693 of Lecture Notes in Computer Science, pages 129\u2013144. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56883-2_8"},{"issue":"1\/2","key":"19_CR8","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","volume":"87","author":"R. Cleaveland","year":"1990","unstructured":"R. Cleaveland and M. Hennessy. Priorities in process algebra. Information and Computation, 87(1\/2): 58\u201377, July\/August 1990.","journal-title":"Information and Computation"},{"issue":"1","key":"19_CR9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1): 36\u201372, January 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR10","first-page":"263","volume-title":"CONCUR '90, volume 458 of Lecture Notes in Computer Science","author":"R. Gerber","year":"1990","unstructured":"R. Gerber and I. Lee. CCSR: A calculus for communicating shared resources. In CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 263\u2013277, Amsterdam, August 1990. Springer-Verlag."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"H. Hansson and F. Orava. A process calculus with incomparable priorities. In Proceedings of the North American Process Algebra Workshop, 1992.","DOI":"10.1007\/978-1-4471-3217-2_4"},{"key":"19_CR12","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, Boston, 1988."},{"key":"19_CR13","volume-title":"Communicating Sequential Processes","author":"C. Hoare","year":"1985","unstructured":"C. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985."},{"key":"19_CR14","unstructured":"C.-T. Jensen. CCS with priorities. Technical report, Computer Science Department, Aarhus University, 1992."},{"key":"19_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989."},{"key":"19_CR16","first-page":"456","volume-title":"CONCUR '90, volume 458 of Lecture Notes in Computer Science","author":"S. Smolka","year":"1990","unstructured":"S. Smolka and B. Steffen. Priority as extremal probability. In CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 456\u2013466, Amsterdam, August 1990. Springer-Verlag."},{"key":"19_CR17","unstructured":"R. van Glabbeek and P. Weijland. Branching time and abstraction in bisimulation semantics. In Information Processing 89, pages 613\u2013618. North-Holland, 1989."}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:43Z","timestamp":1605648223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}