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.
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.
Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac & Anna Ingólfsdóttir (2011):
Axiomatizing GSOS with Predicates.
In: Michel A. Reniers & Pawel Sobocinski: Proceedings Eighth Workshop on Structural Operational Semantics 2011,
EPTCS 62,
pp. 1–15,
doi:10.4204/EPTCS.62.1.
Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac & Anna Ingólfsdóttir (2011):
PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates.
In: Andrea Corradini, Bartek Klin & Corina Cîrstea: Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30-September 2, 2011. Proceedings,
Lecture Notes in Computer Science 6859.
Springer,
pp. 378–385,
doi:10.1007/978-3-642-22944-2_27.
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.
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.
Luca Aceto, Wan Fokkink & Chris Verhoef (2001):
Structural Operational Semantics.
In: Jan A. Bergstra, Alban Ponse & Scott A. Smolka: Handbook of Process Algebra, Chapter 3.
Elsevier Science, Dordrecht, The Netherlands,
pp. 197–292,
doi:10.1016/B978-044482830-9/50021-7.
Luca Aceto, Eugen-Ioan Goriac & Anna Ingólfsdóttir (2013):
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators.
In: SOFSEM,
pp. 108–120,
doi:10.1007/978-3-642-35843-2_11.
Luca Aceto, Eugen-Ioan Goriac, Anna Ingolfsdottir, Mohammad Reza Mousavi & Michel Reniers (2013):
Exploiting Algebraic Laws to Improve Mechanized Axiomatizations.
In: Proceedings of the 5th Conference on Algebra and Coalgebra in Computer Science (CALCO 2013),
Lecture Notes in Computer Science 8089.
Springer-Verlag, Berlin, Germany, 2013.
Luca Aceto, Anna Ingólfsdóttir, Mohammad Reza Mousavi & Michel A. Reniers (2009):
Algebraic Properties for Free!.
Bulletin of the European Association for Theoretical Computer Science 99,
pp. 81–104.
Jos C. M. Baeten & Erik P. de Vink (2004):
Axiomatizing GSOS with termination.
J. Log. Algebr. Program. 60-61,
pp. 323–351,
doi:10.1016/j.jlap.2004.03.001.
Bard Bloom, Sorin Istrail & Albert R. Meyer (1995):
Bisimulation can't be traced.
J. ACM 42,
pp. 232–268,
doi:10.1145/200836.200876.
Ed Brinksma (1985):
A Tutorial on Lotos.
In: Michel Diaz: Proc. Protocol Specification, Testing and Verification V.
North-Holland,
Amsterdam, Netherlands,
pp. 171–194.
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.
Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer & Carolyn L. Talcott (2007):
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic.
Lecture Notes in Computer Science 4350.
Springer,
doi:10.1007/978-3-540-71999-1_1.
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.
Daniel Gebler, Eugen-Ioan Goriac & Mohammad Reza Mousavi (2013):
Algebraic Meta-Theory of Processes with Data.
In: Proceedings Tenth Workshop on Structural Operational Semantics 2013,
Lecture Notes in Computer Science.
Springer-Verlag, Berlin, Germany, 2013.
In the current volume.
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.
Eugen-Ioan Goriac, Georgiana Caltais, Dorel Lucanu, Oana Andrei & Gheorghe Grigoras (2009):
Patterns for Maude Metalanguage Applications.
Electr. Notes Theor. Comput. Sci. 238(3),
pp. 121–138,
doi:10.1016/j.entcs.2009.05.016.
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.
Matthew Hennessy & Robin Milner (1985):
Algebraic laws for nondeterminism and concurrency.
J. ACM 32(1),
pp. 137–161,
doi:10.1145/2455.2460.
C. A. R. Hoare (1985):
Communicating Sequential Processes.
Prentice Hall.
Huimin Lin (1995):
PAM: A Process Algebra Manipulator.
Formal Methods in System Design 7(3),
pp. 243–259,
doi:10.1007/BF01384078.
Robin Milner (1989):
Communication and Concurrency.
Prentice Hall.
Mohammad Reza Mousavi & Michel A. Reniers (2006):
Prototyping SOS meta-theory in Maude.
Electron. Notes Theor. Comput. Sci. 156,
pp. 135–150,
doi:10.1016/j.entcs.2005.09.030.
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.
Mohammad Reza Mousavi, Michel A. Reniers & Jan Friso Groote (2005):
A Syntactic Commutativity Format for SOS.
Information Processing Letters 93,
pp. 217–223,
doi:10.1016/j.ipl.2004.11.007.
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.
Gordon D. Plotkin (1981):
A structural approach to operational semantics.
Technical Report DAIMI FN-19.
Computer Science Department, Aarhus University,
Aarhus, Denmark.
Davide Sangiorgi & David Walker (2001):
The π-Calculus: A Theory of Mobile Processes.
Cambridge University Press,
Cambridge.
With a foreword by Robin Milner.
Traian-Florin Serbanuta, Grigore Rosu & José Meseguer (2009):
A rewriting logic approach to operational semantics.
Information and Computation 207(2),
pp. 305–340,
doi:10.1016/j.ic.2008.03.026.
Alberto Verdejo & Narciso Martí-Oliet (2006):
Executable structural operational semantics in Maude.
The Journal of Logic and Algebraic Programming 67(1Ð2),
pp. 226 – 293,
doi:10.1016/j.jlap.2005.09.008.