Algebra of timed frames

International Journal of Computer Mathematics

Volumn 61, Issue 3-4, 1996, Pages 227-255

  Bergstra, J A ^a,b   Fokkink, W J ^b   Middelburg, C A ^b,c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c KPN RESEARCH   (Netherlands)

Author keywords

Conditional transitions; Discrete time; Frame algebra; Process algebra; Signal inserted states; Timed frames; bisimulation

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL MODELS; SIGNAL PROCESSING;

CONDITIONAL TRANSITIONS; DISCRETE TIME; FRAME ALGEBRA; PROCESS ALGEBRA; SEMANTIC; SIGNAL INSERTED STATES; TIMED FRAMES; TIMED TRANSITION SYSTEM;

ALGEBRA;

EID: 0030413751     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169608804514     Document Type: Article

References (17)

1. Bergstra, J. A. and Ponse, A. (1995). Frame algebra with synchronous communication. In Wieringa, R. J. and Feenstra, R. B. editors, Information Systems - Correctness and Reusability, World Scientific, 3-15.
2. Stirling, C. (1992). Modal and temporal logics, in Abramsky, S. Gabbay, D. and Maibaum, T. S. E. editors, Handbook of Logic and Computer Science, 2, Clarendon Press.
3. Bergstra, J. A. and Ponse, A. (1995). Frame-based process logics. In Ponse, A. de Rijke, M. and Venema, Y. editors, Modal Logic and Process Algebra, CSLI Lecture Notes 53, CSLI Publications, 39-64.
4. Baeten, J. C. M. and Weijland, W. P. (1990). Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press.
5. Bergstra, J. A. and Klop, J. W. (1984). Process algebra for synchronous communication, Information and Control, 60, 109-137.
6. Baeten, J. C. M. and Bergstra, J. A. (1996). Discrete time process algebra, Formal Aspects of Computing, 8, 188-208.
7. van Benthem, J. F. A. K. and Bergstra, J. A. (1995). Logic of transition systems, Journal of Logic, Language and Information, 3, 247-283.
8. van Benthem, J. F. A. K. van Eijck, D. J. N. and Stebletsova, V. (1994). Modal logic, transition systems and processes, Journal of Logic and Computation, 4, 811-855.
9. Baeten, J. C. M. and Bergstra, J. A. (1994). Process algebra with propositional signals, Logic Group Preprint Series 123, Utrecht University, Department of Philosophy.
10. Hennessy, M. and Milner, R. (1985). Algebraic laws for non-determinism and con-currency, Journal of the ACM, 32 135-161.
11. Specification and description language (SDL), ITU-T Recommendation Z.100, Revision 1 (1994).
12. Bergstra, J. A. and Middelburg, C. A. (1995). Process algebra semantics of SDL, Logic Group preprint Series 129, Utrecht Universsity, Department of Philosophy.
13. Reniers, M. A. and Vereijken, J. J. (1995). Completeness in discrete time process algebra, draft.
14. Baeten, J. C. M. and Bergstra, J. A. (1992). Process algebra with signals and conditions. In Broy, M. editor, Programming and Mathematical Methods, NATO ASI Series F88, Springer-Verlag, 273-323.
15. Mauw, S. (1995). Example specifications in φSDL, unpublished manuscript.
16. Baeten, J. C. M. and Bergstra, J. A. (1995). Discrete time process algebra with abstraction. In Reichel, H. editor. Fundamentals of Computation Theory, LNCS 965, Springer-Verlag, 1-15.
17. Nicollin, X. and Sifakis, J. (1994). The algebra of timed processes ATP: Theory and application, Information and Computation, 114, 131-178.