Discrete time process algebra: absolute time, relative time and parametric time

Fundamenta Informaticae

Volumn 29, Issue 1-2, 1997, Pages 51-76

  Baeten, J C M ^a   Bergstra, J A ^b,c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; REAL TIME SYSTEMS; TIME MEASUREMENT;

ABSOLUTE TIME; DISCRETE TIME PROCESS ALGEBRA; PARAMETRIC TIME; RELATIVE TIME;

ALGEBRA;

EID: 0030775823     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-291203     Document Type: Article

References (42)

1. J.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra. Information & Computation 78 (1988) 205-245.
2. J.C.M. Baeten & J.A. Bergstra, Real time process algebra. Formal Aspects of Computing 3 (1991) 142-188.
3. J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra (extended abstract). In: W.R. Cleaveland (ed.), Proc. CONCUR'92, Stony Brook. LNCS 630, Springer Verlag 1992, pp. 401-420.
4. J.C.M. Baeten & J.A. Bergstra, Process algebra with signals and conditions. In: M. Broy (ed.). Programming and mathematical method, Proc. Summer School, Marktoberdorf 1990. NATO ASI Series F 88, Springer Verlag 1992,pp. 273-323.
5. J.C.M. Baeten & J.A. Bergstra, Real space process algebra. Formal Aspects of Computing 5 (1993) 481-529.
6. J.C.M. Baeten & J.A. Bergstra, On sequential composition, action prefixes and process prefix. Formal Aspects of Computing 6 (1994) 250-268.
7. J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra with abstraction. In: H. Reichel (ed.), Proc. FCT'95, Dresden. LNCS 965, Springer Verlag 1995, pp. 1-15.
8. J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra. Formal Aspects of Computing 8 (1996) 188-208.
9. J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae IX (1986) 127-168.
10. J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Ready trace semantics for concrete process algebra with priority operator. British Computer Journal 30 (1987) 498-506.
11. J.C.M. Baeten & W.P. Weijland, Process algebra. Cambridge Tracts in Theor. Comp. Sci. 18. Cambridge University Press 1990.
12. J.A. Bergstra, A process creation mechanism in process algebra. In: J.C.M. Baeten (ed.), Applications of Process Algebra. Cambridge University Press, 1990, pp. 81-88.
13. J.A. Bergstra, I. Bethke & A. Ponse, Process algebra with iteration and nesting. The Computer Journal 37 (1994) 243-258.
14. J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication. Inf. & Control 60 (1984) 109-137.
15. J.A. Bergstra & P. Klint, The TOOLBUS - a component interconnection architecture -. Report P9408, Programming Research Group, University of Amsterdam 1994.
16. J.A. Bergstra & P. Klint, The discrete time TOOLBUS. Report P9502, Programming Research Group, University of Amsterdam 1995.
17. J.A. Bergstra & C.A. Middelburg, A process algebra semantics for φSDL. Report LGPS 129, Dept. of Philosophy, Utrecht University 1995.
18. J.A. Bergstra & A. Ponse, Frame algebra with synchronous communication. In: R.J. Wieringa & R.B. Feenstra (eds.), Proc. IS-CORE '94. World Scientific, 1995, pp. 3-15.
19. 2C-bus in discrete time process algebra. To appear in Sci. of Comp. Progr.
20. L.M.G. Feijs & M. Huizer, TSF, a test specification formalism. In: A. Ponse, C. Verhoef & S.F.M. van Vlijmen (eds.), Proc. ACP'95. Report CSR 95-14, Eindhoven University of Technology 1995, pp. 347-366.
21. W.J. Fokkink, Clocks, trees and stars in process algebra, PhD. Thesis, University of Amsterdam 1994.
22. J.F. Groote, Specification and verification of real time systems in ACP. In: L. Logrippo, R.L. Probert & H. Ural (eds.), Proc. 10th Symp. on Protocol Specification, Testing and Verification, Ottawa. North-Holland, Amsterdam 1990, pp. 261-274.
23. D.P. Gruska & A. Maggiolo-Schettini, A timed process description language based on CCS. Report TR-9/91, Universitá di Pisa 1991.
24. H. Hansson, Time and probabilities in formal design of distributed systems. Ph.D. thesis, report DoCS 91/27, Uppsala University 1991.
25. M. Hennessy & T. Regan, A temporal process algebra. Report 2/90, University of Sussex 1990.
26. C.A.R. Hoare, Communicating sequential processes. Prentice Hall International 1985.
27. C.A.R. Hoare et al., Laws of programming. Comm. of the ACM 30 (1987) 672-686.
28. ISO/IEC Information Technology, OSI conformance testing methodology and framework, part 3: the Tree and Tabular Notation (TTCN).ISO document 1990.
29. A.S. Klusener, Models and axioms for a fragment of real time process algebra. Ph.D. thesis, Eindhoven University of Technology 1993.
30. S. Mauw & M.A. Reniers, An algebraic semantics for basic message sequence charts. The Computer Journal 37 (1994) 269-277.
31. S. Mauw & G.J. Veltink (eds.), Algebraic specification of communication protocols. Cambridge Tracts in Theor. Comp. Sci. 36. Cambridge University Press 1993.
32. S. Mauw, M. van Wijk & T. Winter, A formal semantics of synchronous interworkings. In: O. Færgemand & A. Sarma (eds.), Proc. SDL'93 (Using Objects), Darmstadt. North-Holland 1993, pp. 167-178.
33. G.J. Milne, CIRCAL and the representation of communication, concurrency and time. ACM TOPLAS 7 (1985).
34. R. Milner, A calculus of communicating systems. LNCS 92, Springer Verlag 1980.
35. R. Milner, Communication and concurrency. Prentice Hall International 1989.
36. F. Moller & C. Tofts, A temporal calculus of communicating systems. Report LFCS-89-104, University of Edinburgh 1989.
37. F. Moller & C. Tofts, A temporal calculus of communicating systems. In: J.C.M. Baeten & J.W. Klop (eds.), Proc. CONCUR'90, Amsterdam. LNCS 458. Springer Verlag 1990, pp. 401-415.
38. X. Nicollin & J. Sifakis, The algebra of timed processes ATP: theory and application. Information & Computation 114 (1994) 131-178.
39. D.M.R. Park, Concurrency and automata on infinite sequences. In: P. Deussen (ed.), Proc. 5th GI Conf. LNCS 104, Springer Verlag 1981, pp. 167-183.
40. G.M. Reed & A.W. Roscoe, A timed model for communicating sequential processes. Theor. Comp. Sci. 58 (1988) 249-261.
41. SDL: Specification and description language, ITU-T Recommendation Z.100, Revision 1, 1994.
42. F.W. Vaandrager, Process algebra semantics of POOL. In: J.C.M. Baeten (ed.), Applications of Process Algebra. Cambridge University Press, 1990, pp. 173-236.