Rule formats for timed processes

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 1, 2002, Pages 12-31

  Kick, Marco ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA STRUCTURES; SET THEORY;

COALGEBRAS; META RULES; OPERATIONAL SEMANTICS; TIMED PROCESSES;

SEMANTICS;

EID: 17744382129     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80498-5     Document Type: Conference Paper

References (15)

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, Proceedings of the Conference on Category Theory and Computer Science, volume 389 of LNCS, pages 357-365, Berlin, September 1989. Springer-Verlag.
2. Alur R., Dill D.L. A theory of timed automata. Theoretical Computer Science. 126:(2):25 April 1994;183-235. Fundamental Study
3. F. Bartels. GSOS for probabilistic transition systems (extended abstract). In Larry Moss, editor, Proc. Coalgebraic Methods in Computer Science (CMCS 2002), volume 65 of Electronic Notes in Theoretical Computer Science, 2002.
4. Bloom B., Istrail S., Meyer A.R. Bisimulation can't be traced. Journal of the ACM. 42:(1):January 1995;232-268
5. Corradini A., Heckel R., Montanari U. Compositional SOS and beyond: a coalgebraic view of open systems. Theoretical Computer Science. 280:(1-2):May 2002;163-192. Special issue with selected papers from [7]
6. M. Fiore. Fibred models of processes: Discrete, continuous, and hybrid systems. In IFIP International Conference on Theoretical Computer Science, volume 1872 of Lecture Notes in Computer Science, pages 457-473, 2000.
7. Jacobs B., Rutten J. Coalgebraic Methods in Computer Science (CMCS'1999), volume 19 of Electronic Notes in Theoretical Computer Science. 1999
8. M. Kick. Bialgebraic modelling of timed processes. In P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Proceedings ICALP'02, volume 2380 of Lecture Notes in Computer Science. Springer-Verlag, 2002. Available from http://www.dcs.ed.ac.uk/home/mk.
9. Lenisa M., Power J., Watanabe H. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Reichel H. Third Workshop on Coalgebraic Methods in Computer Science (CMCS'2000), volume 33 of Electronic Notes in Theoretical Computer Science. 2000;233-263
10. F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, CONCUR '90 (Concurrency Theory), volume 458 of Lecture Notes in Computer Science, pages 401-415, Amsterdam, The Netherlands, August 1990. Springer-Verlag.
11. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In K.G. Larsen and A. Skou, editors, Computer Aided Verification (CAV '91), volume 575 of Lecture Notes in Computer Science, pages 376-398, Aalborg, Denmark, July 1991. Springer-Verlag.
12. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981.
13. Power J., Watanabe H. Combining a monad and a comonad. Theoretical Computer Science. 280:(1-2):May 2002;137-162. Special issue with selected papers from [7]
14. D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, June 1996. Available from http://www.dcs.ed.ac.uk/home/dt/.
15. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Twelfth Annual Symposium on Logic in Computer Science (LICS '97), pages 280-291, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.