References

1. J. C. M. Baeten, T. Basten & M. A. Reniers (2010): Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science 50. Cambridge University Press.
2. J. C. M. Baeten, D. A. van Beek, B. Luttik, J. Markovski & J. E. Rooda (2010): Partial Bisimulation. SE Report 10-04. Eindhoven University of Technology. Available from http://se.wtb.tue.nl..
3. J. C. M. Baeten, D. A. van Beek, B. Luttik, J. Markovski & J. E. Rooda (2011): A Process-Theoretic Approach to Supervisory Control Theory. In: Proceedings of ACC 2011. IEEE, pp. 4496–4501.
4. C. Baier & J.-P. Katoen (2008): Principles of Model Checking. MIT Press.
5. D. Bustan & O. Grumberg (2003): Simulation-based minimization. ACM Transactions on Computational Logic 4, pp. 181–206.
6. C. Cassandras & S. Lafortune (2004): Introduction to discrete event systems. Kluwer Academic Publishers.
7. J.-C. Fernandez (1990): An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13(2-3), pp. 219–236, doi:10.1016/0167-6423(90)90071-K.
8. R. Gentilini, C. Piazza & A. Policriti (2003): From Bisimulation to Simulation: Coarsest Partition Problems. Journal of Automated Reasoning 31(1), pp. 73–103, doi:10.1023/A:1027328830731.
9. R. J. van Glabbeek (2001): The linear time–branching time spectrum I. Handbook of Process Algebra, pp. 3–99.
10. R. J. van Glabbeek & B. Ploeger (2008): Correcting a Space-Efficient Simulation Algorithm. In: Proceedings of CAV, LNCS 5123. Springer, pp. 517–529, doi:10.1007/978-3-540-70545-1_49.
11. J. F. Groote, A. H. J. Mathijssen, M. A. Reniers, Y. S. Usenko & M. J. van Weerdenburg (2009): Process Algebra for Parallel and Distributed Processing, chapter Analysis of distributed systems with mCRL2, pp. 99–128. Chapman & Hall.
12. M. R. Henzinger, T. A. Henzinger & P. W. Kopke (1995): Computing Simulations on Finite and Infinite Graphs. In: Proceedings of FOCS 1995. IEEE, pp. 453–462.
13. J. Markovski (2011): Saving Time in a Space-Efficient Simulation Algorithm. In: Proceedings of FMDS/QSIC 2011, doi:10.1109/QSIC.2011.26.
14. J. Markovski (2012): Partial bisimulation minimization. 9118\p@ plus2\p@ minus4\p@ \z@ plus\p@ 4\p@ plus2\p@ minus2\p@ \defłeftmarginłeftmargini 2.5\p@ plus1.5\p@ minus\p@ 5\p@ plus2\p@ minus5\p@ıtemsep 2.5\p@ plus1.5\p@ minus\p@łeftmarginłeftmargini 4\p@ plus2\p@ minus2\p@ 2\p@ plus\p@ minus\p@ıtemsep http://sites.google.com/site/jasenmarkovski.
15. R. Paige & R. E. Tarjan (1987): Three Partition Refinement Algorithms. SIAM Journal on Computing 16(6), pp. 973–989, doi:10.1137/0216062.
16. P. J. Ramadge & W. M. Wonham (1987): Supervisory Control of a Class of Discrete Event Processes. SIAM Journal on Control and Optimization 25(1), pp. 206–230, doi:10.1137/0325013.
17. F. Ranzato & F. Tapparo (2010): An efficient simulation algorithm based on abstract interpretation. Information and Computation 208, pp. 1–22, doi:10.1016/j.ic.2009.06.002.
18. J. J. M. M. Rutten (1999): Coalgebra, concurrency, and control. SEN Report R-9921. Center for Mathematics and Computer Science, Amsterdam, The Netherlands.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org