{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:19:54Z","timestamp":1765887594835},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319062501"},{"type":"electronic","value":"9783319062518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06251-8_2","type":"book-chapter","created":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T01:32:39Z","timestamp":1396920759000},"page":"19-36","source":"Crossref","is-referenced-by-count":6,"title":["Endowing Concurrent Kleene Algebra with Communication Actions"],"prefix":"10.1007","author":[{"given":"Jason","family":"Jaskolka","sequence":"first","affiliation":[]},{"given":"Ridha","family":"Khedri","sequence":"additional","affiliation":[]},{"given":"Qinglei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. Bergstra","year":"1984","unstructured":"Bergstra, J., Klop, J.: Process algebra for synchronous communication. Information and Control\u00a060(1-3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-44881-0_7","volume-title":"Rewriting Techniques and Applications","author":"M. Clavel","year":"2003","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: The Maude 2.0 System. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 76\u201387. Springer, Heidelberg (2003)"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/242223.242252","volume":"28","author":"R. Cleaveland","year":"1996","unstructured":"Cleaveland, R., Smolka, S.: Strategic directions in concurrency research. ACM Computing Surveys\u00a028(4), 607\u2013625 (1996)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E. Emerson","year":"1986","unstructured":"Emerson, E., Halpern, J.: \u201csometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time temporal logic. Journal of the ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"key":"2_CR6","unstructured":"Hebisch, U., Weinert, H.: Semirings: Algebraic Theory and Applications in Computer Science. Series in Algebra, vol.\u00a05. World Scientific (1993)"},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. Hoare","year":"1978","unstructured":"Hoare, C.: Communicating sequential processes. Communications of the ACM\u00a021(8), 666\u2013677 (1978)","journal-title":"Communications of the ACM"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Hoare, C.: Communicating Sequential Processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-04081-8_27","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C. Hoare","year":"2009","unstructured":"Hoare, C., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 399\u2013414. Springer, Heidelberg (2009)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Hoare, C., M\u00f6ller, B., Struth, G., Wehrman, I.: Foundations of concurrent Kleene algebra. In: Berghammer, R., Jaoua, A.M., M\u00f6ller, B. (eds.) RelMiCS\/AKA 2009. LNCS, vol.\u00a05827, pp. 166\u2013186. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04639-1_12"},{"key":"2_CR11","unstructured":"Hoare, C., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. Tech. Rep. CS-10-04, University of Sheffield, Department of Computer Science, Sheffield, UK (August 2010), http:\/\/www.dcs.shef.ac.uk\/~georg\/ka\/"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"C. Hoare","year":"2011","unstructured":"Hoare, C., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. Journal of Logic and Algebraic Programming\u00a080(6), 266\u2013296 (2011)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"2_CR13","unstructured":"Hoare, C., Wickerson, J.: Unifying models of data flow. In: Broy, M., Leuxner, C., Hoare, C. (eds.) Proceedings of the 2010 Marktoberdorf Summer School on Software and Systems Safety, pp. 211\u2013230. IOS Press (August 2011)"},{"key":"2_CR14","unstructured":"Holcombe, W.: Algebraic Automata Theory. Cambridge Studies in Advanced Mathematics. Cambridge University Press (2004)"},{"key":"#cr-split#-2_CR15.1","doi-asserted-by":"crossref","unstructured":"Jaskolka, J., Khedri, R., Zhang, Q.: On the necessary conditions for covert channel existence: A state-of-the-art survey. Procedia Computer Science\u00a010, 458-465 (2012)","DOI":"10.1016\/j.procs.2012.06.059"},{"key":"#cr-split#-2_CR15.2","unstructured":"Proceedings of the 3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 (2012)"},{"key":"2_CR16","unstructured":"Jaskolka, J., Khedri, R., Zhang, Q.: Foundations of communicating concurrent Kleene algebra. Tech. Rep. CAS-13-07-RK, McMaster University, Hamilton, Ontario, Canada (November 2013), http:\/\/www.cas.mcmaster.ca\/cas\/0template1.php?601"},{"issue":"7","key":"2_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R. Keller","year":"1976","unstructured":"Keller, R.: Formal verification of parallel programs. Communications of the ACM\u00a019(7), 371\u2013384 (1976)","journal-title":"Communications of the ACM"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kilp, M., Knauer, U., Mikhalev, A.: Monoids, Acts And Categories With Applications to Wreath Products and Graphs: A Handbook for Students and Researchers. De Gruyter Expositions in Mathematics Series, vol.\u00a029. Walter de Gruyter (2000)","DOI":"10.1515\/9783110812909"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Automata and Computability. Undergraduate Texts in Computer Science. Springer (1997)","DOI":"10.1007\/978-1-4612-1844-9"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/jsco.2000.0406","volume":"33","author":"S. Linton","year":"2002","unstructured":"Linton, S., Pfeiffer, G., Robertson, E., Ru\u0161kuc, N.: Computing transformation semigroups. Journal of Symbolic Computation\u00a033(2), 145\u2013162 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-17906-2_30","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 278\u2013324. Springer, Heidelberg (1987)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"2_CR23","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International Series in Computer Science. Prentice Hall (1989)"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes part I. Information and Computation\u00a0100(1), 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"2_CR25","unstructured":"Petri, C.: Kommunikation mit Automaten. Ph.D. thesis, Institut f\u00fcr instrumentelle Mathematik, Bonn, Germany (1962), English translation available as: Communication with Automata, Technical Report RADC-TR-65-377, vol. 1, supplement 1, Applied Data Research, Princeton, NJ (1966)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. International Journal of Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"International Journal of Parallel Programming"},{"issue":"5","key":"2_CR28","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1093\/comjnl\/32.5.399","volume":"32","author":"M. Shields","year":"1989","unstructured":"Shields, M.: Implicit system specification and the interface equation. The Computer Journal\u00a032(5), 399\u2013412 (1989)","journal-title":"The Computer Journal"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Steinberg, B.: A theory of transformation monoids: Combinatorics and representation theory. The Electronic Journal of Combinatorics\u00a017(1) (2010)","DOI":"10.37236\/436"},{"key":"2_CR30","unstructured":"Watson, J.: Behaviorism. University of Chicago Press (1930)"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06251-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T11:43:30Z","timestamp":1597664610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06251-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319062501","9783319062518"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06251-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}