References

  1. L. Aceto, A. Ingolfsdottir, K.G. Larsen & J. Srba (2007): Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, doi:10.1017/CBO9780511814105.
  2. L. Aceto, A. Ingolfsdottir, P. B. Levy & J. Sack (2012): Characteristic Formulae for Fixed-Point Semantics: A General Framework. Mathematical Structures in Computer Science, doi:10.4204/EPTCS.8.1. Special issue devoted to selected papers from EXPRESS 2009, Cambridge University Press.
  3. Jan Bergstra, Alban Ponse & Scott A. Smolka (2001): Handbook of Process Algebra. Elsevier.
  4. R. van Glabbeek (2001): The linear time–branching time spectrum. I. The semantics of concrete, sequential processes. In: editor = "Bergstra",, pp. 3–99, doi:10.1016/B978-044482830-9/50019-9.
  5. 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.
  6. M. Hennessy & R. Milner (1985): Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), pp. 137–161, doi:10.1145/2455.2460.
  7. R.M. Keller (1976): Formal verification of parallel programs. Communications of the ACM 19(7), pp. 371–384, doi:10.1145/360248.360251.
  8. Dexter Kozen (1983): Results on the Propositional mu-Calculus. Theoretical Computer Science 27, pp. 333–354, doi:10.1016/0304-3975(82)90125-6.
  9. Kim Guldstrand Larsen (1990): Proof Systems for Satisfiability in Hennessy–Milner Logic with Recursion. Theoretical Computer Science 72(2–3), pp. 265–288, doi:10.1016/0304-3975(90)90038-J.
  10. A. Tarski (1955): A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics 5(2), pp. 285–309. Available at http://projecteuclid.org/euclid.pjm/1103044538.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org