{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T17:11:38Z","timestamp":1723655498948},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2015,5,22]],"date-time":"2015-05-22T00:00:00Z","timestamp":1432252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00236-015-0238-x","type":"journal-article","created":{"date-parts":[[2015,5,21]],"date-time":"2015-05-21T09:23:11Z","timestamp":1432200191000},"page":"393-442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Denotational fixed-point semantics for constructive scheduling of synchronous concurrency"],"prefix":"10.1007","volume":"52","author":[{"given":"Joaqu\u00edn","family":"Aguado","sequence":"first","affiliation":[]},{"given":"Michael","family":"Mendler","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"von Hanxleden","sequence":"additional","affiliation":[]},{"given":"Insa","family":"Fuhrmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,22]]},"reference":[{"issue":"2","key":"238_CR1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"issue":"2","key":"238_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/inco.1996.0077","volume":"129","author":"L Aceto","year":"1996","unstructured":"Aceto, L., Ingolfsdottir, A.: CPO models for compact GSOS languages. Inf. Comput. 129(2), 107\u2013141 (1996)","journal-title":"Inf. Comput."},{"key":"238_CR3","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.tcs.2010.09.007","volume":"241","author":"J Aguado","year":"2011","unstructured":"Aguado, J., Mendler, M.: Constructive semantics for instantaneous reactions. Theor. Comput. Sci. 241, 931\u2013961 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"238_CR4","doi-asserted-by":"crossref","unstructured":"Aguado, J., Mendler, M., von Hanxleden, R., Fuhrmann, I.: Grounding synchronous deterministic concurrency in sequential programming. In: Proceedings of the 23rd European Symposium on Programming (ESOP\u201914). LNCS 8410, pp. 229\u2013248. Springer, Grenoble, France (2014)","DOI":"10.1007\/978-3-642-54833-8_13"},{"key":"238_CR5","unstructured":"Aguado, J., Mendler, M., von Hanxleden, R., Fuhrmann, I.: Denotational fixed-point semantics for constructive scheduling of synchronous concurrency. Technical report 96, University of Bamberg, Faculty of Information Systems and Applied Computer Sciences (2015). ISSN 0937\u20133349"},{"key":"238_CR6","doi-asserted-by":"crossref","unstructured":"Andalam, S., Roop, P.S., Girault, A.: Deterministic, predictable and light-weight multithreading using PRET-C. In: Proceedings of the Conference on Design. Automation and Test in Europe (DATE\u201910), pp. 1653\u20131656. Dresden, Germany (2010)","DOI":"10.1109\/DATE.2010.5457078"},{"key":"238_CR7","doi-asserted-by":"crossref","unstructured":"Baudart, G., Mandel, L., Pouzet, M.: Programming mixed music in ReactiveML. In: Proceedings of the First ACM SIGPLAN Workshop on Functional Art. Music, Modeling & #38; Design, FARM \u201913, pp. 11\u201322. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2505341.2505344"},{"issue":"1","key":"238_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/inco.2000.9999","volume":"163","author":"A Benveniste","year":"2000","unstructured":"Benveniste, A., Caillaud, B., Guernic, P.L.: Compositionality in dataflow synchronous languages: specification and distributed code generation 1,2,3. Inf. Comput. 163(1), 125\u2013171 (2000)","journal-title":"Inf. Comput."},{"key":"238_CR9","doi-asserted-by":"crossref","unstructured":"Benveniste, A., Caspi, P., Edwards, S.A., Halbwachs, N., Guernic, P.L., de Simone, R.: The Synchronous Languages Twelve Years Later. In: Proceedings of IEEE, Special Issue on Embedded Systems, vol. 91, pp. 64\u201383. IEEE, Piscataway, NJ, USA (2003)","DOI":"10.1109\/JPROC.2002.805826"},{"key":"238_CR10","unstructured":"Bergstra, J., Ponse, A., Smolka, S. (eds.): Handbook of Process Algebra. Elsevier (2001)"},{"key":"238_CR11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.7551\/mitpress\/5641.003.0021","volume-title":"Proof, Language, and Interaction: Essays in Honour of Robin Milner","author":"G Berry","year":"2000","unstructured":"Berry, G.: The foundations of Esterel. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 425\u2013454. MIT Press, Cambridge (2000)"},{"key":"238_CR12","unstructured":"Berry, G.: The Constructive Semantics of Pure Esterel. Draft Book, Version 3.0, Centre de Math\u00e9matiques Appliq\u00e9es, Ecole des Mines de Paris and INRIA, 2004 route des Lucioles, 06902 Sophia-Antipolis CDX, France (2002)"},{"key":"238_CR13","first-page":"89","volume-title":"Algebraic Semantics","author":"G Berry","year":"1985","unstructured":"Berry, G., Curien, P.L., L\u00e9vy, J.J.: Full abstraction for sequential languages: the state of the art. In: Nivat, M., Reynolds, J.C. (eds.) Algebraic Semantics, pp. 89\u2013132. Cambridge University Press, Cambridge (1985)"},{"issue":"2","key":"238_CR14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G Berry","year":"1992","unstructured":"Berry, G., Gonthier, G.: The Esterel synchronous programming language: design, semantics, implementation. Sci. Comput. Program. 19(2), 87\u2013152 (1992)","journal-title":"Sci. Comput. Program."},{"key":"238_CR15","doi-asserted-by":"crossref","unstructured":"Berry, G., Nicolas, C., Serrano, M.: Hiphop: A synchronous reactive extension for Hop. In: Proceedings of the 1st ACM SIGPLAN International Workshop on Programming Language and Systems Technologies for Internet Clients. PLASTIC \u201911, pp. 49\u201356. ACM, New York, NY, USA (2011)","DOI":"10.1145\/2093328.2093337"},{"issue":"4","key":"238_CR16","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1002\/spe.4380210406","volume":"21","author":"F Boussinot","year":"1991","unstructured":"Boussinot, F.: Reactive C: an extension of C to program reactive systems. Softw. Pract. Exp. 21(4), 401\u2013428 (1991)","journal-title":"Softw. Pract. Exp."},{"issue":"5","key":"238_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/cpe.919","volume":"18","author":"F Boussinot","year":"2006","unstructured":"Boussinot, F.: Fairthreads: mixing cooperative and preemptive threads in C. Concurr. Comput. Pract. Exp. 18(5), 445\u2013469 (2006)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"238_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4210-9","volume-title":"Asynchronous Circuits","author":"JA Brzozowski","year":"1995","unstructured":"Brzozowski, J.A., Seger, C.J.H.: Asynchronous Circuits. Springer, New York (1995)"},{"key":"238_CR19","doi-asserted-by":"crossref","unstructured":"Caspi, P., Pilaud, D., Halbwachs, N., Plaice, J.A.: Lustre: a declarative language for programming synchronous systems. In: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL\u201987), pp. 178\u2013188. ACM, Munich, Germany (1987)","DOI":"10.1145\/41625.41641"},{"key":"238_CR20","doi-asserted-by":"crossref","unstructured":"Caspi, P., Pouzet, M.: A co-iterative characterization of synchronous stream functions. Electron. Notes Theor. Comput. Sci. 11(0), 1\u201321 (1998). CMCS\u201998, First Workshop on Coalgebraic Methods in Computer Science","DOI":"10.1016\/S1571-0661(04)00050-7"},{"key":"238_CR21","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., L\u00fcttgen, G., Mendler, M.: An algebraic theory of multiple clocks. In: CONCUR \u201997, LNCS, vol. 1243, pp. 166\u2013180. Springer (1997)","DOI":"10.1007\/3-540-63141-0_12"},{"key":"238_CR22","doi-asserted-by":"crossref","unstructured":"Cohen, A., Duranton, M., Eisenbeis, C., Pagetti, C., Plateau, F., Pouzet, M.: N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems. Symposium on Principles of Programming Languages. POPL\u201906, pp. 180\u2013193. ACM, New York, NY, USA (2006)","DOI":"10.1145\/1111037.1111054"},{"key":"238_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"238_CR24","doi-asserted-by":"crossref","unstructured":"de Roever, W.P., L\u00fcttgen, G., Mendler, M.: What is in a step: new perspectives on a classical question. In: Manna, Z., Peled, D.A. (eds.) Time for Verification, pp. 370\u2013399. Springer LNCS 6200 (2010)","DOI":"10.1007\/978-3-642-13754-9_15"},{"issue":"2","key":"238_CR25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"238_CR26","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/762488.762489","volume":"8","author":"SA Edwards","year":"2003","unstructured":"Edwards, S.A.: Tutorial: compiling concurrent languages for sequential processors. ACM Trans. Design Autom. Electron. Syst. 8(2), 141\u2013187 (2003)","journal-title":"ACM Trans. Design Autom. Electron. Syst."},{"issue":"1","key":"238_CR27","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0167-6423(02)00096-5","volume":"48","author":"SA Edwards","year":"2003","unstructured":"Edwards, S.A., Lee, E.A.: The semantics and execution of a synchronous block-diagram language. Sci. Comput. Program. 48(1), 21\u201342 (2003)","journal-title":"Sci. Comput. Program."},{"key":"238_CR28","doi-asserted-by":"crossref","unstructured":"Edwards, S.A., Lee, E.A.: The semantics and execution of a synchronous block-diagram language. In: Science of Computer Programming, vol. 48. Elsevier (2003)","DOI":"10.1016\/S0167-6423(02)00096-5"},{"key":"238_CR29","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z.: Axiomatizing the least fixed point operation and binary supremum. In: Clote, P., Schwichtenberg, H. (eds.) Computer Science Logic (CSL\u201900), LNCS 1862, pp. 302\u2013316. Springer (2000)","DOI":"10.1007\/3-540-44622-2_20"},{"issue":"1","key":"238_CR30","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1006\/inco.2002.2968","volume":"179","author":"M Fiore","year":"2002","unstructured":"Fiore, M., Moggi, E., Sangiorgi, D.: A fully abstract model for the $$\\pi $$ \u03c0 -calculus. Inf. Comput. 179(1), 76\u2013117 (2002)","journal-title":"Inf. Comput."},{"issue":"5","key":"238_CR31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/2016603.1967688","volume":"46","author":"A Gamati\u00e9","year":"2011","unstructured":"Gamati\u00e9, A., Gonnord, L.: Static analysis of synchronous programs in Signal for efficient design of multi-clocked embedded systems. ACM Sigplan Notices 46(5), 71\u201380 (2011)","journal-title":"ACM Sigplan Notices"},{"key":"238_CR32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/1687-3963-2013-3","volume":"2013","author":"M Gem\u00fcnde","year":"2013","unstructured":"Gem\u00fcnde, M., Brandt, J., Schneider, K.: Clock refinement in imperative synchronous languages. EURASIP J. Embed. Syst. 2013, 3 (2013)","journal-title":"EURASIP J. Embed. Syst."},{"key":"238_CR33","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"JF Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Inf. Comput. 100, 202\u2013260 (1992)","journal-title":"Inf. Comput."},{"issue":"9","key":"238_CR34","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1109\/5.97301","volume":"79","author":"PL Guernic","year":"1991","unstructured":"Guernic, P.L., Goutier, T., Borgne, M.L., Maire, C.L.: Programming real time applications with SIGNAL. Proc. IEEE 79(9), 1321\u20131336 (1991)","journal-title":"Proc. IEEE"},{"key":"238_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2231-4","volume-title":"Synchronous Programming of Reactive Systems","author":"N Halbswachs","year":"1993","unstructured":"Halbswachs, N.: Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, Dordrecht (1993)"},{"issue":"9","key":"238_CR36","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous data-flow programming language LUSTRE. Proc. IEEE 79(9), 1305\u20131320 (1991)","journal-title":"Proc. IEEE"},{"key":"238_CR37","doi-asserted-by":"crossref","unstructured":"Hamon, G.: A denotational semantics for Stateflow. In: EMSOFT\u201905: Proceedings of the 5th ACM International Conference on Embedded Software, pp. 164\u2013172. ACM Press, New York, NY, USA (2005)","DOI":"10.1145\/1086228.1086260"},{"issue":"3","key":"238_CR38","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D Harel","year":"1987","unstructured":"Harel, D.: Statecharts: a visual formalism for complex systems. Sci. Comput. Program. 8(3), 231\u2013274 (1987)","journal-title":"Sci. Comput. Program."},{"issue":"4","key":"238_CR39","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/235321.235322","volume":"5","author":"D Harel","year":"1996","unstructured":"Harel, D., Naamad, A.: The STATEMATE semantics of statecharts. ACM Trans. Softw. Eng. 5(4), 293\u2013333 (1996)","journal-title":"ACM Trans. Softw. Eng."},{"issue":"4","key":"238_CR40","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M.: Acceptance trees. J. ACM 32(4), 896\u2013928 (1985)","journal-title":"J. ACM"},{"key":"238_CR41","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. Inf. Comput. 117, 221\u2013239 (1995)","journal-title":"Inf. Comput."},{"key":"238_CR42","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Upper Saddle River, NJ (1985)"},{"key":"238_CR43","doi-asserted-by":"crossref","unstructured":"Huizing, C., Gerth, R., de Roever, W.: Modeling Statecharts behavior in a fully abstract way. In: Dauchet, M., Nivat, M. (eds.) 13th CAAP (CAAP \u201988). Lecture Notes in Computer Science, vol. 299, pp. 271\u2013294. Springer, Nancy, France (1988)","DOI":"10.1007\/BFb0026110"},{"issue":"2","key":"238_CR44","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M Hyland","year":"2000","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF: I. II and III. Inf. Comput. 163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"238_CR45","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(99)00117-6","volume":"254","author":"A Ing\u00f3lfsd\u00f3ttir","year":"2001","unstructured":"Ing\u00f3lfsd\u00f3ttir, A., Schalk, A.: A fully abstract denotational model for observational precongruence. Theor. Comput. Sci. 254(1\u20132), 35\u201361 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"238_CR46","unstructured":"Kahn, G.: The semantics of a simple language for parallel programming. In: Rosenfeld, J.L. (ed.) Information Processing 74: In: Proceedings of the IFIP Congress 74, pp. 471\u2013475. North-Holland Publishing Co., IFIP (1974)"},{"key":"238_CR47","unstructured":"Kahn, G., MacQueen, D.B.: Coroutines and networks of parallel processes. In: IFIP Congress, pp. 993\u2013998 (1977)"},{"key":"238_CR48","doi-asserted-by":"crossref","unstructured":"Kok, J.N.: Denotational semantics of nets with nondeterminism. In: Robinet, B., Wilhelm, R. (eds.) European Symposium on Programming (ESOP\u201986), LNCS 213, pp. 237\u2013249. Springer (1986)","DOI":"10.1007\/3-540-16442-1_18"},{"issue":"2","key":"238_CR49","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"238_CR50","doi-asserted-by":"crossref","unstructured":"Kuper, L., Turon, A., Krishnaswami, N.R., Newton, R.R.: Freeze after writing: Quasi-deterministic parallel programming with LVars. In: Principles of Programming Languages (POPL\u201914), pp. 257\u2013270. ACM, New York, USA (2014)","DOI":"10.1145\/2535838.2535842"},{"key":"238_CR51","doi-asserted-by":"crossref","unstructured":"Lavagno, L., Sentovich, E.: ECL: a specification environment for system-level design. In: Proceedings of 36th ACM\/IEEE Conference on Design Automation (DAC\u201999), pp. 511\u2013516. ACM (1999)","DOI":"10.1145\/309847.309989"},{"key":"238_CR52","doi-asserted-by":"crossref","unstructured":"Lee, E.A., Messerschmitt, D.G.: Synchronous data flow. In: Proceedings of the IEEE, vol. 75, pp. 1235\u20131245. IEEE Computer Society Press (1987)","DOI":"10.1109\/PROC.1987.13876"},{"key":"238_CR53","doi-asserted-by":"crossref","unstructured":"Leung, A., Gupta, M., Agarwal, Y., Gupta, R., Jhala, R., Lerner, S.: Verifying GPU kernels by test amplification. In: Programming Language Design and Implementation PLDI 2012, pp. 383\u2013394. ACM, New York, USA (2012)","DOI":"10.1145\/2254064.2254110"},{"issue":"1","key":"238_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/504077.504078","volume":"3","author":"G Luettgen","year":"2002","unstructured":"Luettgen, G., Mendler, M.: The intuitionism behind statecharts steps. ACM Trans. Comput. Log. 3(1), 1\u201341 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"238_CR55","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., von der Beeck, M., Cleaveland, R.: Statecharts via process algebra. In: Proceedings of 10th International Conference on Concurrency Theory CONCUR\u201999, pp. 399\u2013414 (1999)","DOI":"10.1007\/3-540-48320-9_28"},{"key":"238_CR56","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., Mendler, M.: Towards a model-theory for Esterel. In: Maraninchi, F., Girault, A., Rutten, E. (eds.) SLAP 2002, ENTCS, vol. 65,5. Elsevier Science (2002)","DOI":"10.1016\/S1571-0661(05)80444-X"},{"key":"238_CR57","volume-title":"Distributed Algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, Los Altos (1996)"},{"issue":"7","key":"238_CR58","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1109\/43.293952","volume":"13","author":"S Malik","year":"1994","unstructured":"Malik, S.: Analysis of cyclic combinational circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(7), 950\u2013956 (1994)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"238_CR59","doi-asserted-by":"crossref","unstructured":"Mandel, L., Pasteur, C., Pouzet, M.: Time refinement in a functional synchronous language. In: Principles and Practice of Declarative Programming (PPDP\u201913), pp. 169\u2013180. ACM (2013)","DOI":"10.1145\/2505879.2505904"},{"key":"238_CR60","doi-asserted-by":"crossref","unstructured":"Mandel, L., Pouzet, M.: ReactiveML: a reactive extension to ML. In: Proceedings of 7th ACM SIGPLAN Int\u2019l Conference on Principles and Practice of Declarative Programming, pp. 82\u201393 (2005)","DOI":"10.1145\/1069774.1069782"},{"key":"238_CR61","unstructured":"Maraninchi, F.: The Argos language: graphical representation of automata and description of reactive systems. In: IEEE Workshop on Visual Languages (1991)"},{"issue":"27","key":"238_CR62","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0096-0551(01)00016-9","volume":"27","author":"F Maraninchi","year":"2001","unstructured":"Maraninchi, F., R\u00e9mond, Y.: Argos: an automaton-based synchronous language. Comput. Lang. 27(27), 61\u201392 (2001)","journal-title":"Comput. Lang."},{"issue":"6","key":"238_CR63","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.ic.2009.05.005","volume":"208","author":"M Mendler","year":"2010","unstructured":"Mendler, M., L\u00fcttgen, G.: Is observational congruence axiomatisable in equational Horn logic? Inf. Comput. 208(6), 634\u2013651 (2010)","journal-title":"Inf. Comput."},{"issue":"3","key":"238_CR64","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10703-012-0144-6","volume":"40","author":"M Mendler","year":"2012","unstructured":"Mendler, M., Shiple, T.R., Berry, G.: Constructive boolean circuits and the exactness of timed ternary simulation. Form. Methods Syst. Des. 40(3), 283\u2013329 (2012)","journal-title":"Form. Methods Syst. Des."},{"key":"238_CR65","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"238_CR66","doi-asserted-by":"crossref","unstructured":"Motika, C., von Hanxleden, R., Heinold, M.: Programming deterministice reactive systems with Synchronous Java (invited paper). In: Proceedings of the 9th Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS 2013), IEEE Proceedings. Paderborn, Germany (2013)","DOI":"10.1109\/ISORC.2013.6913222"},{"key":"238_CR67","doi-asserted-by":"crossref","unstructured":"Ngo, V.C., Talpin, J.P., Gautier, T.: Precise deadlock detection for polychronous data-flow specifications. In: Proceedings of the Electronic System Level Synthesis Conference (ESLsyn), pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/ESLsyn.2014.6850379"},{"key":"238_CR68","unstructured":"Plotkin, G.D.: A Structural Approach to Operational Semantics. Technical report DAIMI FN-19, University of Aarhus, Denmark (1981)"},{"key":"238_CR69","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Shalev, M.: What is in a step: on the semantics of Statecharts. In: Proceedings of International Conference on Theoretical Aspects of Computer Software (TACS\u201991), pp. 244\u2013264. Springer, London, UK (1991)","DOI":"10.1007\/3-540-54415-1_49"},{"key":"238_CR70","volume-title":"Compiling Esterel","author":"D Potop-Butucaru","year":"2007","unstructured":"Potop-Butucaru, D., Edwards, S.A., Berry, G.: Compiling Esterel. Springer, Berlin (2007)"},{"issue":"3","key":"238_CR71","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10617-010-9053-3","volume":"14","author":"M Pouzet","year":"2010","unstructured":"Pouzet, M., Raymond, P.: Modular static scheduling of synchronous data-flow networks\u2014an efficient symbolic representation. Des. Autom. Embed. Syst. 14(3), 165\u2013192 (2010)","journal-title":"Des. Autom. Embed. Syst."},{"key":"238_CR72","unstructured":"Schneider, K.: The synchronous programming language Quartz. Internal Report 375, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany (2009)"},{"key":"238_CR73","doi-asserted-by":"crossref","unstructured":"Schneider, K., Brandt, J., Schuele, T.: Causality analysis of synchronous programs with delayed actions. In: Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES\u201904), pp. 179\u2013189. ACM, Washington DC, USA (2004)","DOI":"10.1145\/1023833.1023859"},{"key":"238_CR74","doi-asserted-by":"crossref","unstructured":"Schneider, K., Brandt, J., Schuele, T., Tuerk, T.: Maximal causality analysis. In: Conference on Application of Concurrency to System Design (ACSD\u201905), pp. 106\u2013115. IEEE Computer Society (2005)","DOI":"10.1109\/ACSD.2005.24"},{"key":"238_CR75","unstructured":"Schneider, K., Brandt, J., Sch\u00fcle, T., T\u00fcrk, T.: Improving constructiveness in code generators. In: Maraninchi, F., Pouzet, M., Roy, V. (eds.) International Workshop on Synchronous Languages, Applications, and Programming (SLAP\u201905), pp. 1\u201319. ENTCS, Edinburgh, Scotland, UK (2005)"},{"key":"238_CR76","doi-asserted-by":"crossref","unstructured":"Shiple, T.R., Berry, G., Touati, H.: Constructive Analysis of Cyclic Circuits. In: Proceedings of European Design and Test Conference (ED&TC\u201996), Paris, France, pp. 328\u2013333. IEEE Computer Society Press (1996)","DOI":"10.1109\/EDTC.1996.494321"},{"issue":"3","key":"238_CR77","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.scico.2014.04.009","volume":"96","author":"JP Talpin","year":"2014","unstructured":"Talpin, J.P., Brandt, J., Gem\u00fcnde, M., Schneider, K., Shukla, S.: Constructive polychronous systems. Sci. Comput. Program. 96(3), 377\u2013394 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"238_CR78","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.scico.2010.06.006","volume":"77","author":"JP Talpin","year":"2012","unstructured":"Talpin, J.P., Ouy, J., Gautier, T., Besnard, L., Guernic, P.L.: Compositional design of isochronous systems. Sci. Comput. Program. 77(2), 113\u2013128 (2012)","journal-title":"Sci. Comput. Program."},{"key":"238_CR79","doi-asserted-by":"crossref","unstructured":"Tardieu, O., Edwards, S.A.: Scheduling-independent threads and exceptions in SHIM. In: Proceedings of the International Conference on Embedded Software (EMSOFT\u201906), pp. 142\u2013151. ACM (2006)","DOI":"10.1145\/1176887.1176908"},{"key":"238_CR80","unstructured":"Tardieu, O., Edwards, S.A.: Instanteneous transitions in Esterel. In: Proceedings of Model Driven High-Level Programming of Embedded Systems (SLA++P\u201907). Braga, Portugal (2007)"},{"key":"238_CR81","doi-asserted-by":"crossref","unstructured":"Vechev, M., Yahav, E., Raman, R., Sarkar, V.: Automatic verification of determinism for structured parallel programs. In: Cousot, R., Martel, M. (eds.) Static Analysis (SAS 2010), LNCS, vol. 6337, pp. 455\u2013471. Springer (2010)","DOI":"10.1007\/978-3-642-15769-1_28"},{"key":"238_CR82","doi-asserted-by":"crossref","unstructured":"von der Beeck, M.: A comparison of Statecharts variants. In: Langmaack, H., de Roever, W., Vytopil, J. (eds.) 3rd International School and Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT \u201994), Lecture Notes in Computer Science, vol. 863, pp. 128\u2013148. Springer (1994)","DOI":"10.1007\/3-540-58468-4_163"},{"key":"238_CR83","doi-asserted-by":"crossref","unstructured":"von Hanxleden, R.: SyncCharts in C-A Proposal for Light-Weight, Deterministic Concurrency. In: Proceedingsof International Conference on Embedded Software (EMSOFT\u201909), pp. 225\u2013234. ACM, Grenoble, France (2009)","DOI":"10.1145\/1629335.1629366"},{"key":"238_CR84","doi-asserted-by":"crossref","unstructured":"von Hanxleden, R., Duderstadt, B., Motika, C., Smyth, S., Mendler, M., Aguado, J., Mercer, S., O\u2019Brien, O.: SCCharts: sequentially constructive statecharts for safety-critical applications. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201914). ACM (2014)","DOI":"10.1145\/2666356.2594310"},{"key":"238_CR85","doi-asserted-by":"crossref","unstructured":"von Hanxleden, R., Mendler, M., Aguado, J., Duderstadt, B., Fuhrmann, I., Motika, C., Mercer, S., O\u2019Brien, O.: Sequentially constructive concurrency\u2014a conservative extension of the synchronous model of computation. In: Design, Automation and Test in Europe (DATE\u201913), pp. 581\u2013586. IEEE (2013)","DOI":"10.7873\/DATE.2013.128"},{"key":"238_CR86","doi-asserted-by":"crossref","unstructured":"von Hanxleden, R., Mendler, M., Aguado, J., Duderstadt, B., Fuhrmann, I., Motika, C., Mercer, S., O\u2019Brien, O., Roop, P.: Sequentially constructive concurrency\u2014a conservative extension of the synchronous model of computation. ACM Trans. Embed. Comput. Syst.,Special Issue on Applications of Concurrency to System Design 13(4s), 144:1\u2013144:26 (2014)","DOI":"10.1145\/2627350"},{"key":"238_CR87","doi-asserted-by":"crossref","unstructured":"Yuki, T., Feautrier, P., Rajopadye, S., Saraswat, V.: Array dataflow analysis for polyhedral X10 programs. In: Principles and Practice of Parallel Programming (PPoPP 2013), pp. 23\u201334. ACM (2013)","DOI":"10.1145\/2442516.2442520"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0238-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0238-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0238-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T04:19:39Z","timestamp":1717906779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0238-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,22]]},"references-count":87,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["238"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0238-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,22]]}}}