Minimisation and minimal realisation in Span (Graph)

Mathematical Structures in Computer Science

Volumn 14, Issue 5, 2004, Pages 685-714

  Rosebrugh, Robert ^a   Sabadini, Nicoletta ^b   Walters, Robert F C ^b  

^a MOUNT ALLISON UNIVERSITY   (Canada)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27844587732     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S096012950400430X     Document Type: Article

References (22)

1. Arnold, A. (1992) Finite Transition Systems, Prentice-Hall.
2. Attie, P.C. and Emerson, E. (1998) Synthesis of concurrent systems with many similar processes. ACM Trans, on Prog. Lang, and Systems (TOPLAS) 20 51–115.
3. Bloom, S., Sabadini, N. and Walters, R. F. C. (1996) Matrices, machines and behaviors. Applied Categorical Structures 4 343–360.
4. Bunge, M. and Fiore, M. (2000) Unique factorisation lifting functors and categories of linearly-controlled processes. Mathematical Structures in Computer Science 10 137–163.
5. Carboni, A. and Rosebrugh, R. (1991) Lax monads. Journal of Pure and Applied Algebra 76 13–32.
6. Clarke, E., Long, D. and McMillan, K. (1989) Compositional model checking. In: Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science 353–362.
7. van Glabbeek, R. and Weijland, P. (1996) Branching time and abstraction in bisimulation semantics. Journal of the ACM 43 555–600.
8. Goguen, J. A. (1972) Minimal realization of machines in closed categories. Bulletin of the AMS 78 777–783.
9. Graf, S., Steffen, B. and Luttgen, G. (1996) Compositional minimization of finite state systems using interface specifications. International Journal of Formal Aspects of Computing 8 607–616.
10. Hennessey, M. and Milner, R. (1980) On observing nondeterminism and concurrency. In: Automata, languages and programming (Proc. Seventh Internat. Colloq., Noordwijkerhout). Springer-Verlag Lecture Notes in Computer Science 85 299–309.
11. Joyal, A., Nielson, M. and Winskel, G. (1996) Bisimulation from open maps. Information and Computation 127 164–185.
12. Kasangian, S. and Vigna, S. (1997) The topos of labelled trees: A categorical semantics for SCCS. Fundamenta Informaticae 32 27–45.
13. Katis, P., Rosebrugh, R., Sabadini, N. and Walters, R. F. C. (2000) An automata model of distributed systems. Proceedings of the Workshop on Trace Theory and Code Parallelization, Universita degli Studi di Milano 125–144.
14. Katis, P., Sabadini, N. and Walters, R. F. C. (1997a ) Bicategories of processes. Journal of Pure and Applied Algebra 115 141–178.
15. Katis, P. Sabadini, N. and Walters, R. F. C. (1997b ) Span(Graph): a categorical algebra of transition systems. In: Proceedings AMAST ‘97. Springer-Verlag Lecture Notes in Computer Science 1349 322–336.
16. Katis, R, Sabadini, N. and Walters, R.F.C. (1997c ) Representing P/T nets in Span(Graph). In: Proceedings AMAST ’97. Springer-Verlag Lecture Notes in Computer Science 1349 307–321.
17. Katis, R, Sabadini, N. and Walters, R. F. C. (1998) On partita doppia. Theory and Applications of Categories (to appear). Katis, P., Sabadini, N. and Walters, R. F. C. (2000) On the algebra of systems with feedback and boundary. Rendiconti del Circolo Matematico di Palermo Serie II, Suppl. 63 123–156.
18. Katis, P., Sabadini, N. and Walters, R. F. C. (2001) Classes of finite state automata for which compositional minimization is linear time (preprint).
19. Katis, P., Sabadini, N. and Walters, R. F. C. (2002) Feedback, trace and fixed-point semantics. Theor. Informatics Appl. 36 181–194.
20. Rosebrugh, R., Sabadini, N. and Walters, R. F. C. (1998) Minimal realization in bicategories of automata. Mathematical Structures in Computer Science 8 93–116.
21. Rosebrugh, R. and Wood, R. J. (1991) Pullback preserving functors. Journal of Pure and Applied Algebra 73 73–90.
22. Wraith, G. (1974) Artin glueing. Journal of Pure and Applied Algebra 4 345–348.