Bialgebraic modelling of timed processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 525-536

  Kick, Marco ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ABSTRACT THEORY; COALGEBRAS; COMONADS; DISCRETE TIME; MONOID ACTIONS; MONOIDS; TIMED PROCESS;

AUTOMATA THEORY;

EID: 84869195047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_45     Document Type: Conference Paper

References (25)

1. P. Aczel and P. F. Mendler. A final coalgebra theorem. In D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poigné, editors, Category Theory and Computer Science, LNCS 389, pp. 357-365, 1989. Springer.
2. R. Alur and D. L. Dill A theory of timed automata. Theoretical Computer Science 25(2), pp. 183-235, 1994.
3. J.C.M. Baeten and J.W. Klop, editors. Concurrency Theory (CONCUR '90), LNCS 458, 1990. Springer.
4. J.C.M. Baeten and C.A. Middelburg. Process algebra with timing: real time and discrete time. In Bergstra et al. [5], chapter 10.
5. J. A. Bergstra, A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. North-Holland, 2001.
6. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation 60, pp. 109-137, 1984.
7. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced. Journal of the ACM 42(1), pp. 232-268, 1995.
8. R.J. van Glabbeek. The linear time - branching time spectrum I; the semantics of concrete, sequential processes. In Bergstra et al. [5], chapter 1, pages 3-99.
9. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation 117, pp. 221-239, 1995.
10. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
11. J.J.M. Hooman and W.P. de Roever. Design and verification in real-time distributed computing: an introduction to compositional methods. In E. Brinksma, G. Scollo, and Chris A. Vissers, editors. International Conference on Protocol Specification, Testing and Verification, 1989. North-Holland.
12. A. Jeffrey. A linear time process algebra. In Larsen and Skou [14], pp. 432-442.
13. A. S. A. Jeffrey, S. A. Schneider, and F. W. Vaandrager. A comparison of additivity axioms in timed transition systems. Technical Report CS-R9366, CWI, 1993.
14. K.G. Larsen and A. Skou, editors. Computer Aided Verification (CAV '91), LNCS 575, 1991. Springer.
15. W. Lawvere. Metric spaces, generalized logic, and closed categories. In Rendiconti del Seminario Matematico e Fisico di Milano, XLIII. Tipografia Fusi, 1973.
16. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
17. F. Moller and C. Tofts. A temporal calculus of communicating systems. In Baeten and Klop [3], pp. 401-415.
18. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Larsen and Skou [14], pp. 376-398.
19. X. Nicollin and J. Sifakis. The algebra of timed processes, ATP: Theory and application. Information and Computation 114, pp. 131-178, 1994.
20. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
21. J. Power and H.Watanabe. Distributivity for a monad and a comonad. In B. Jacobs and J. Rutten, editors, Second Workshop on Coalgebraic Methods in Computer Science (CMCS'1999), volume 19 of ENTCS, 1999.
22. S. A. Schneider. An operational semantics for timed CSP. Technical Report PRGTR-1-91, Oxford University, 1991.
23. D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, 1996.
24. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Twelfth Annual Symposium on Logic in Computer Science (LICS '97), pp. 280-291, 1997. IEEE Computer Society Press.
25. Y. Wang. Real-time behaviour of asynchronous agents. In Baeten and Klop [3], pp. 502-520.