References

  1. Luca Aceto, Arnar Birgisson, Anna Ingólfsdóttir, Mohammad Reza Mousavi & Michel A. Reniers (2012): Rule formats for determinism and idempotence. Science of Computer Programming 77(7–8), pp. 889–907, doi:10.1016/j.scico.2010.04.002.
  2. Luca Aceto, Bard Bloom & Frits W. Vaandrager (1994): Turning SOS rules into equations. Information and Computation 111, pp. 1–52, doi:10.1006/inco.1994.1040.
  3. Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi & Michel A. Reniers (2011): Rule Formats for Distributivity. In: Adrian Horia Dediu, Shunsuke Inenaga & Carlos Martín-Vide: Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26–31, 2011. Proceedings, Lecture Notes in Computer Science 6638. Springer, pp. 80–91, doi:10.1007/978-3-642-21254-3_5.
  4. Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi & Michel A. Reniers (2011): SOS rule formats for zero and unit elements. Theoretical Computer Science 412(28), pp. 3045–3071, doi:10.1016/j.tcs.2011.01.024.
  5. Luca Aceto, Anna Ingolfsdottir, MohammadReza Mousavi & Michel A. Reniers (2009): Algebraic Properties for Free!. Bulletin of the European Association for Theoretical Computer Science (BEATCS) 99, pp. 81–104.
  6. Franz Baader & Tobias Nipkow (1999): Term Rewriting and All That. Cambridge University Press.
  7. J.C.M. (Jos) Baeten, Twan Basten & Michel A. Reniers (2010): Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science. Cambrdige University Press.
  8. Jos C. M. Baeten & Jan A. Bergstra (1997): Process Algebra with Propositional Signals. Theoretical Computer Science (TCS) 177(2), pp. 381–405, doi:10.1016/S0304-3975(96)00253-8.
  9. Christel Baier & Joost-Pieter Katoen (2008): Principles of Model Checking. MIT Press.
  10. D. A. van Beek, Ka Lok Man, Michel A. Reniers, J. E. Rooda & Ramon R. H. Schiffelers (2006): Syntax and consistent equation semantics of hybrid Chi. J. Log. Algebr. Program. 68(1-2), pp. 129–210, doi:10.1016/j.jlap.2005.10.005.
  11. D. A. van Beek, Michel A. Reniers, Ramon R. H. Schiffelers & J. E. Rooda (2007): Foundations of a Compositional Interchange Format for Hybrid Systems. In: Alberto Bemporad, Antonio Bicchi & Giorgio C. Buttazzo: Proceedings of the 10th International Workshop on Hybrid Systems: Computation and Control (HSCC'07), Lecture Notes in Computer Science 4416. Springer, pp. 587–600, doi:10.1007/978-3-540-71493-4_45.
  12. Jan A Bergstra & A. (Kees) Middelburg (2007): Synchronous cooperation for explicit multi-threading. Acta Informatica 44, pp. 525–569, doi:10.1007/s00236-007-0057-9.
  13. Bard Bloom, Sorin Istrail & Albert R. Meyer (1995): Bisimulation can't be traced. J. ACM 42, pp. 232–268, doi:10.1145/200836.200876.
  14. Antonio Brogi & Jean-Marie Jacquet (1998): On the Expressiveness of Linda-like Concurrent Languages. Electr. Notes Theor. Comput. Sci. 16(2), pp. 75–96, doi:10.1016/S1571-0661(04)00118-5.
  15. Nicholas Carriero & David Gelernter (1989): Linda in Context. Communications of the ACM 32(4), pp. 444–459, doi:10.1145/63334.63337.
  16. Robert J. Colvin & Ian J. Hayes (2011): Structural Operational Semantics through Context-Dependent Behaviour. Journal of Logic and Algebraic Programming 80(7), pp. 392–426, doi:10.1016/j.jlap.2011.05.001.
  17. Sjoerd Cranen, Mohammad Reza Mousavi & Michel A. Reniers (2008): A Rule Format for Associativity. In: Franck van Breugel & Marsha Chechik: Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), Lecture Notes in Computer Science 5201. Springer-Verlag, pp. 447–461, doi:10.1007/978-3-540-85361-9_35.
  18. Pierpaolo Degano & Corrado Priami (2001): Enhanced operational semantics. ACM Computing Surveys 33(2), pp. 135–176, doi:10.1145/384192.384194.
  19. Fabio Gadducci & Ugo Montanari (2000): The Tile Model. In: Gordon D. Plotkin, Colin Stirling & Mads Tofte: Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, Boston, MA, USA, 2000, pp. 133–166.
  20. Vashti Galpin, Luca Bortolussi & Jane Hillston (2013): HYPE: Hybrid modelling by composition of flows. Formal Asp. Comput. 25(4), pp. 503–541, doi:10.1007/s00165-011-0189-0.
  21. R.J. van Glabbeek (2001): The Linear Time - Branching Time Spectrum I. The Semantics of Concrete, Sequential Processes. In: A. Ponse S.A. Smolka J.A. Bergstra: Handbook of Process Algebra. Elsevier, pp. 3–99, doi:10.1007/3-540-57208-2_6.
  22. Jan Friso Groote & Frits W. Vaandrager (1992): Structured Operational Semantics and Bisimulation As a Congruence. Information and Computation 100(2), pp. 202–260, doi:10.1016/0890-5401(92)90013-6.
  23. Matthew Hennessy & Robin Milner (1985): Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), pp. 137–161, doi:10.1145/2455.2460.
  24. Narciso Martí-Oliet & José Meseguer (2002): Rewriting Logic as a Logical and Semantic Framework. In: Dov M. Gabbay & Franz Guenthner: Handbook of Philosophical Logic 9. Kluwer Academic Publishers, 2002, pp. 1–87, doi:10.1007/978-94-017-0464-9_1.
  25. José Meseguer & Christiano Braga (2004): Modular Rewriting Semantics of Programming Languages. In: Charles Rattray, Savi Maharaj & Carron Shankland: Proceedings of the 10th International Conference on Algebraic Methodology and Software Technology (AMAST'04), Lecture Notes in Computer Science 3116. Springer-Verlag, Berlin, Germany, 2004, pp. 364–378, doi:10.1007/978-3-540-27815-3_29.
  26. Peter D. Mosses (2004): Exploiting Labels in Structural Operational Semantics. Fundam. Inform. 60(1-4), pp. 17–31.
  27. Peter D. Mosses (2004): Modular structural operational semantics. J. Log. Algebr. Program. 60-61, pp. 195–228, doi:10.1016/j.jlap.2004.03.008.
  28. Peter D. Mosses & Mark J. New (2009): Implicit Propagation in Structural Operational Semantics. Electr. Notes Theor. Comput. Sci. 229(4), pp. 49–66, doi:10.1016/j.entcs.2009.07.073.
  29. Mohammad Reza Mousavi, Michel Reniers & Jan Friso Groote (2004): Congruence for SOS with Data. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04). IEEE Computer Society Press, Los Alamitos, CA, USA, 2004, pp. 302–313, doi:10.1109/LICS.2004.1319625.
  30. Mohammad Reza Mousavi, Michel A. Reniers & Jan Friso Groote (2004): Congruence for SOS with Data. In: LICS, pp. 303–312, doi:10.1109/LICS.2004.1319625.
  31. Mohammad Reza Mousavi, Michel A. Reniers & Jan Friso Groote (2005): Notions of Bisimulation and Congruence Formats for SOS with Data. Information and Computation 200(1), pp. 107–147, doi:10.1016/j.ic.2005.03.002.
  32. Mohammad Reza Mousavi, Michel A. Reniers & Jan Friso Groote (2005): A syntactic commutativity format for SOS. Inf. Process. Lett. 93(5), pp. 217–223, doi:10.1016/j.ipl.2004.11.007.
  33. Scott Owens (2008): A Sound Semantics for OCamllight. In: Sophia Drossopoulou: ESOP, Lecture Notes in Computer Science 4960. Springer, pp. 1–15, doi:10.1007/978-3-540-78739-6_1.
  34. David Michael Ritchie Park (1981): Concurrency and Automata on Infinite Sequences. In: Peter Deussen: Theoretical Computer Science, Lecture Notes in Computer Science 104. Springer, pp. 167–183, doi:10.1007/BFb0017309.
  35. Gordon D. Plotkin (1981): A structural approach to operational semantics. Technical Report DAIMI FN-19. Computer Science Department, Aarhus University, Aarhus, Denmark.
  36. Gordon D. Plotkin (2004): The origins of structural operational semantics. Journal of Logic and Algebraic Programming (JLAP) 60, pp. 3–15, doi:10.1016/j.jlap.2004.03.009.
  37. Gordon D. Plotkin (2004): A structural approach to operational semantics. Journal of Logic and Algebraic Progamming (JLAP) 60, pp. 17–139. This article first appeared as Plotkin81.
  38. Michel A. Reniers, Jan Friso Groote, Mark B. van der Zwaag & Jos van Wamel (2002): Completeness of Timed μCRL. Fundamenta Informaticae 50(3-4), pp. 361–402.
  39. A. W. (Bill) Roscoe (2010): Understanding Concurrent Systems. Springer, doi:10.1007/978-1-84882-258-0.
  40. Christopher Strachey (2000): Fundamental Concepts in Programming Languages. Higher-Order and Symbolic Computation 13, pp. 11–49, doi:10.1023/A:1010000313106.
  41. Daniele Turi & Gordon D. Plotkin (1997): Towards a Mathematical Operational Semantics. In: LICS. IEEE Computer Society, pp. 280–291, doi:10.1109/LICS.1997.614955.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org