{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:09:56Z","timestamp":1725700196785},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327834"},{"type":"electronic","value":"9783642327841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32784-1_10","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T12:59:34Z","timestamp":1344862774000},"page":"170-190","source":"Crossref","is-referenced-by-count":1,"title":["From Transitions to Executions"],"prefix":"10.1007","author":[{"given":"Eleftherios","family":"Matsikoudis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward A.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Abrahamson, K.: Decidability and Expressiveness of Logics of Programs. PhD thesis, University of Washington at Seattle (1980)","key":"10_CR1"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58027-1_1","volume-title":"Mathematical Foundations of Programming Semantics","author":"P. Aczel","year":"1994","unstructured":"Aczel, P.: Final Universes of Processes. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, pp. 1\u201328. Springer, Heidelberg (1994)"},{"unstructured":"Aczel, P.: A semantic universe for the study of fairness. Very Rough and Incomplete Draft (October 1996)","key":"10_CR3"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.P.: A Final Coalgebra Theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"issue":"1-3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2003.12.022","volume":"316","author":"J. Ad\u00e1mek","year":"2004","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: On coalgebra based on classes. Theoretical Computer Science\u00a0316(1-3), 3\u201323 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","volume":"3","author":"K.R. Apt","year":"1983","unstructured":"Apt, K.R., Olderog, E.-R.: Proof rules and transformations dealing with fairness. Science of Computer Programming\u00a03(1), 65\u2013100 (1983)","journal-title":"Science of Computer Programming"},{"issue":"2-3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.07.036","volume":"335","author":"J.C.M. Baeten","year":"2005","unstructured":"Baeten, J.C.M.: A brief history of process algebra. Theoretical Computer Science\u00a0335(2-3), 131\u2013146 (2005)","journal-title":"Theoretical Computer Science"},{"unstructured":"Barwise, J., Moss, L.: Vicious Circles. Lecture Notes, vol.\u00a060. CLSI (1996)","key":"10_CR8"},{"unstructured":"Berger, M.: An interview with Robin Milner (September 2003), \n                  \n                    http:\/\/www.informatics.sussex.ac.uk\/users\/mfb21\/interviews\/milner\/","key":"10_CR9"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/BFb0013028","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Boudol","year":"1989","unstructured":"Boudol, G., Castellani, I.: Permutation of Transitions: An Event Structure Semantics for CCS and SCCS. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 411\u2013427. Springer, Heidelberg (1989)"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(93)90152-J","volume":"114","author":"G. Boudol","year":"1993","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science\u00a0114(1), 31\u201361 (1993)","journal-title":"Theoretical Computer Science"},{"key":"10_CR12","first-page":"200","volume-title":"Proceedings of the First North American Process Algebra Workshop, NAPAW 1992","author":"R.J.C. Costa da","year":"1993","unstructured":"da Costa, R.J.C., Courtiat, J.-P.: A causality-based semantics for CCS. In: Proceedings of the First North American Process Algebra Workshop, NAPAW 1992, pp. 200\u2013215. Springer, London (1993)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1145\/12130.12159","volume-title":"Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986","author":"C. Courcoubetis","year":"1986","unstructured":"Courcoubetis, C., Vardi, M.Y., Wolper, P.: Reasoning about fair concurrent programs. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 283\u2013294. ACM, New York (1986)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(85)90095-7","volume":"37","author":"P. Darondeau","year":"1985","unstructured":"Darondeau, P.: About fair asynchrony. Theoretical Computer Science\u00a037, 305\u2013336 (1985)","journal-title":"Theoretical Computer Science"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-53479-2_10","volume-title":"Semantics of Systems of Concurrent Processes","author":"P. Darondeau","year":"1990","unstructured":"Darondeau, P., Degano, P.: Causal Trees: Interleaving + Causality. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.\u00a0469, pp. 239\u2013255. Springer, Heidelberg (1990)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0036905","volume-title":"Automata, Languages and Programming","author":"P. Darondeau","year":"1983","unstructured":"Darondeau, P., Kott, L.: On the Observational Semantics of Fair Parallelism. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 147\u2013159. Springer, Heidelberg (1983)"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90095-Y","volume":"75","author":"P. Degano","year":"1990","unstructured":"Degano, P., De Nicola, R., Montanari, U.: A partial ordering semantics for CCS. Theoretical Computer Science\u00a075(3), 223\u2013262 (1990)","journal-title":"Theoretical Computer Science"},{"unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall (1976)","key":"10_CR18"},{"issue":"1-2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(83)90082-8","volume":"26","author":"E.A. Emerson","year":"1983","unstructured":"Emerson, E.A.: Alternative semantics for temporal logics. Theoretical Computer Science\u00a026(1-2), 121\u2013130 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time temporal logic. J. ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"J. ACM"},{"unstructured":"Peter Gumm, H.: Elements of the general theory of coalgebras. Lecture Notes for LUATCS 1999 at Rand Afrikaans University, Johannesburg, South Africa (1999)","key":"10_CR21"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF00289140","volume":"21","author":"M. Hennessy","year":"1984","unstructured":"Hennessy, M.: Axiomatising finite delay operators. Acta Informatica\u00a021(1), 61\u201388 (1984)","journal-title":"Acta Informatica"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"issue":"1-3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(85)80025-5","volume":"67","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Stirling, C.: The power of the future perfect in program logics. Information and Control\u00a067(1-3), 23\u201352 (1985)","journal-title":"Information and Control"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S1571-0661(05)80311-1","volume":"29","author":"T.T. Hildebrandt","year":"1999","unstructured":"Hildebrandt, T.T.: A fully abstract presheaf semantics of SCCS with finite delay. Electronic Notes in Theoretical Computer Science\u00a029, 102\u2013126 (1999)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Computer and System Sciences"},{"issue":"7","key":"10_CR27","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM\u00a019(7), 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1145\/567446.567463","volume-title":"Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980","author":"L. Lamport","year":"1980","unstructured":"Lamport, L.: \u201cSometime\u201d is sometimes \u201cnot never\u201d: On the temporal logic of programs. In: Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980, pp. 174\u2013185. ACM, New York (1980)"},{"doi-asserted-by":"crossref","unstructured":"Matsikoudis, E., Lee, E.A.: Labelled execution systems. Technical Report UCB\/EECS-2012-64, EECS Department, University of California, Berkeley (May 2012)","key":"10_CR29","DOI":"10.21236\/ADA561739"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-08921-7_57","volume-title":"Mathematical Foundations of Computer Science 1978","author":"R. Milner","year":"1978","unstructured":"Milner, R.: Synthesis of Communicating Behaviour. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol.\u00a064, pp. 71\u201383. Springer, Heidelberg (1978)"},{"key":"10_CR31","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)"},{"unstructured":"Milner, R.: A finite delay operator in synchronous CCS. Technical Report CSR-116-82, University of Edinburgh (1982)","key":"10_CR32"},{"unstructured":"Milner, R.: A calculus of communicating systems. Report ECS-LFCS-86-7, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh (August 1986)","key":"10_CR33"},{"key":"10_CR34","series-title":"Prentice Hall International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice-Hall, Upper Saddle River (1989)"},{"key":"10_CR35","first-page":"129","volume":"34","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Automata Studies\u00a034, 129\u2013153 (1956)","journal-title":"Automata Studies"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/3-540-10007-5_47","volume-title":"Abstract Software Specifications","author":"D. Park","year":"1980","unstructured":"Park, D.: On the Semantics of Fair Parallelism. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol.\u00a086, pp. 504\u2013526. Springer, Heidelberg (1980)"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"unstructured":"Plotkin, G.D.: A structural approach to operational semantics (Aarhus notes). Technical Report DAIMI FN\u201319, Computer Science Department, Aarhus University (September 1981)","key":"10_CR38"},{"key":"10_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2004.03.009","volume":"60-61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: The origins of structural operational semantics. Journal of Logic and Algebraic Programming\u00a060-61, 3\u201315 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022460","volume-title":"Semantics of Concurrent Computation","author":"A. Pnueli","year":"1979","unstructured":"Pnueli, A.: The Temporal Semantics of Concurrent Programs. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol.\u00a070, pp. 1\u201320. Springer, Heidelberg (1979)"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/567752.567761","volume-title":"Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL 1979","author":"V.R. Pratt","year":"1979","unstructured":"Pratt, V.R.: Process logic: Preliminary report. In: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL 1979, pp. 93\u2013100. ACM, New York (1979)"},{"issue":"1","key":"10_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-56596-5_45","volume-title":"Semantics: Foundations and Applications","author":"J. Rutten","year":"1993","unstructured":"Rutten, J., Turi, D.: On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol.\u00a0666, pp. 477\u2013530. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32784-1_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:15:45Z","timestamp":1620130545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32784-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327834","9783642327841"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32784-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}