References

  1. L. Aceto, W. Fokkink & C. Verhoef (2000): Structural Operational Semantics. In: J. Bergstra, A. Ponse & S. Smolka: Handbook of Process Algebra, chapter 3. Springer, pp. 197–292.
  2. D. Austry & G. Boudol (1984): Algèbre de Processus et Synchronisation. Theoretical Computer Science 30, pp. 91–131, doi:10.1016/0304-3975(84)90067-7.
  3. J.C.M. Baeten & W.P. Weijland (1990): Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, doi:10.1017/CBO9780511624193.
  4. J.A. Bergstra (1988): ACP with signals. In: J. Grabowski, P. Lescanne & W. Wechler: Proc. International Workshop on Algebraic and Logic Programming, LNCS 343. Springer, pp. 11–20, doi:10.1007/3-540-50667-5_53.
  5. S.D. Brookes, C.A.R. Hoare & A.W. Roscoe (1984): A theory of communicating sequential processes. Journal of the ACM 31(3), pp. 560–599, doi:10.1145/828.833.
  6. F. Corradini, M.R. Di Berardini & W. Vogler (2009): Time and Fairness in a Process Algebra with Non-blocking Reading. In: M. Nielsen, A. Kucera, P.B. Miltersen, C. Palamidessi, P. Tuma & F.D. Valencia: Theory and Practice of Computer Science, SOFSEM'09, LNCS 5404. Springer, pp. 193–204, doi:10.1007/978-3-540-95891-8_20.
  7. V. Dyseryn, R.J. van Glabbeek & P. Höfner (2017): Analysing Mutual Exclusion using Process Algebra with Signals. In: K. Peters & S. Tini: Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, Berlin, Germany, 4th September 2017, Electronic Proceedings in Theoretical Computer Science 255. Open Publishing Association, pp. 18–34, doi:10.4204/EPTCS.255.2.
  8. R.J. van Glabbeek (1994): On the expressiveness of ACP (extended abstract). In: A. Ponse, C. Verhoef & S.F.M. van Vlijmen: Proceedings First Workshop on the Algebra of Communicating Processes, ACP'94, Utrecht, The Netherlands, May 1994, Workshops in Computing. Springer, pp. 188–217, doi:10.1007/978-1-4471-2120-6_8.
  9. R.J. van Glabbeek (2017): Lean and Full Congruence Formats for Recursion. In: Proceedings 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017. IEEE Computer Society Press, doi:10.1109/LICS.2017.8005142.
  10. R.J. van Glabbeek (2019): Justness: A Completeness Criterion for Capturing Liveness Properties (extended abstract). In: M. Bojańczyk & A. Simpson: Proceedings 22st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19); held as part of the European Joint Conferences on Theory and Practice of Software (ETAPS'19), Prague, Czech Republic, April 2019, LNCS 11425. Springer, pp. 505–522, doi:10.1007/978-3-030-17127-8_29.
  11. R.J. van Glabbeek & P. Höfner (2015): Progress, Fairness and Justness in Process Algebra. Technical Report 8501. NICTA, Sydney, Australia. Available at http://arxiv.org/abs/1501.03268.
  12. R.J. van Glabbeek & P. Höfner (2019): Progress, Justness and Fairness. ACM Computing Surveys 52(4):69, doi:10.1145/3329125.
  13. R.J. van Glabbeek, P. Höfner & W. Wang (2021): Enabling Preserving Bisimulation Equivalence. In: S. Haddad & D. Varacca: Proceedings 32nd International Conference on Concurrency Theory, CONCUR'21, Leibniz International Proceedings in Informatics (LIPIcs) 203. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, doi:10.4230/LIPIcs.CONCUR.2021.33.
  14. R.J. van Glabbeek, P. Höfner & W. Wang (2021): Enabling Preserving Bisimulation Equivalence. Available at https://arxiv.org/abs/2108.00142. Full version of GHW21ea.
  15. R.J. van Glabbeek, P. Höfner & W. Wang (2023): A Lean-Congruence Format for EP-Bisimilarity. ArXiv:2308.16350. Full version of this paper.
  16. J.F. Groote & F.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.
  17. R. Milner (1990): Operational and algebraic semantics of concurrent processes. In: J. van Leeuwen: Handbook of Theoretical Computer Science, chapter 19. Elsevier Science Publishers B.V. (North-Holland), pp. 1201–1242. Alternatively see Communication and Concurrency, Prentice-Hall, Englewood Cliffs, 1989, of which an earlier version appeared as A Calculus of Communicating Systems, LNCS 92, Springer, 1980, doi:10.1007/3-540-10235-3.
  18. R. Milner (1983): Calculi for Synchrony and Asynchrony. Theoretical Computer Science 25, pp. 267–310, doi:10.1016/0304-3975(83)90114-7.
  19. M.R. Mousavi, M.A. Reniers & J.F. Groote (2007): SOS formats and meta-theory: 20 years after. Theoretical Computer Science 373(3), pp. 238–272, doi:10.1016/j.tcs.2006.12.019.
  20. K.V.S. Prasad (1991): A Calculus of Broadcasting Systems. In: S. Abramsky & T.S.E. Maibaum: Proceedings of the International Joint Conference on Theory and Practice of Software Development, TAPSOFT'91, Volume 1: Colloquium on Trees in Algebra and Programming, CAAP'91, LNCS 493. Springer, pp. 338–358, doi:10.1007/3-540-53982-4_19.
  21. A. Rensink (2000): Bisimilarity of Open Terms. Information and Computation 156(1-2), pp. 345–385, doi:10.1006/inco.1999.2818.
  22. R. de Simone (1985): Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science 37, pp. 245–267, doi:10.1016/0304-3975(85)90093-3.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org