Process algebra for hybrid systems

Theoretical Computer Science

Volumn 335, Issue 2-3, 2005, Pages 215-280

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

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Continuous relative timing; Hybrid systems; Process algebra; Propositional signals; State evolutions; State transitions

Indexed keywords

AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; SEMANTICS; THEOREM PROVING;

CONTINUOUS RELATIVE TIMING; HYBRID SYSTEMS; PROCESS ALGEBRA; PROPOSITIONAL SIGNALS; STATE EVOLUTIONS; STATE TRANSITIONS;

ALGEBRA;

EID: 18044369652     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.04.019     Document Type: Conference Paper

References (55)

1. L. Aceto, W.J. Fokkink, and C. Verhoef Structural operational semantics J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier Amsterdam 197 292
2. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine The algorithmic analysis of hybrid systems Theoret. Comput. Sci. 138 1995 3 34
3. R. Alur, C. Courcoubetis, T.A. Henzinger, and P.-H. Ho Hybrid automata an algorithmic approach to the specification and verification of hybrid systems R.L. Grossman A. Nerode A.P. Ravn H. Rischel Hybrid Systems, Lecture Notes in Computer Science Vol. 736 1993 Springer Berlin 209 229
4. R. Alur, and D.L. Dill Automata for modeling real-time systems M.S. Paterson Proc. 17th ICALP, Lecture Notes in Computer Science Vol. 443 1990 Springer Berlin 322 335
5. R. Alur, and D.L. Dill A theory of timed automata Theoret. Comput. Sci. 126 1994 183 235
6. R. Alur, R. Grosu, I. Lee, and O. Sokolsky Compositional refinement for hierarchical hybrid systems M.D. Di Benedetto A. Sangiovanni-Vincentelli HSCC 2001, Lecture Notes in Computer Science Vol. 2034 2001 Springer Berlin 33 48
7. R. Alur, T.A. Henzinger, and P.-H. Ho Automatic symbolic verification of embedded systems IEEE Trans. Software Eng. 22 3 1996 181 201
8. J.C.M. Baeten, and J.A. Bergstra Real time process algebra Formal Aspects Comput. 3 2 1991 142 188
9. J.C.M. Baeten, and J.A. Bergstra Real space process algebra Formal Aspects Comput. 5 6 1993 481 529
10. J.C.M. Baeten, and J.A. Bergstra Real time process algebra with infinitesimals A. Ponse C. Verhoef S.F.M. van Vlijmen Algebra of Communicating Processes 1994, Workshops in Computing Series 1995 Springer Berlin 148 187
11. J.C.M. Baeten, and J.A. Bergstra Process algebra with propositional signals Theoret. Comput. Sci. 177 1997 381 405
12. J.C.M. Baeten, J.A. Bergstra, and M.A. Reniers Discrete time process algebra with silent step G.D. Plotkin C. Stirling M. Tofte Proof, Language and Interaction Essays in Honour of Robin Milner 2000 MIT Press Cambridge, MA 535 569
13. J.C.M. Baeten, and C.A. Middelburg Process algebra with timing real time and discrete time J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier Amsterdam 627 684
14. J.C.M. Baeten, C.A. Middelburg, Process Algebra with Timing, Monographs in Theoretical Computer Science, An EATCS Series, Springer, Berlin, 2002.
15. J.C.M. Baeten, C.A. Middelburg, M.A. Reniers, A new equivalence for processes with timing - with an application to protocol verification, Computer Science Report 02-10, Department of Mathematics and Computer Science, Eindhoven University of Technology, October 2002.
16. J.C.M. Baeten, and W.P. Weijland Process algebra Cambridge Tracts in Theoretical Computer Science Vol. 18 1990 Cambridge University Press Cambridge
17. J.A. Bergstra, W.J. Fokkink, and C.A. Middelburg Algebra of timed frames Internat. J. Comput. Math. 61 1996 227 255
18. J.A. Bergstra, and J.W. Klop The algebra of recursively defined processes and the algebra of regular processes J. Paredaens Proc. 11th ICALP, Lecture Notes in Computer Science Vol. 172 1984 Springer Berlin 82 95
19. J.A. Bergstra, and J.W. Klop Verification of an alternating bit protocol by means of process algebra W. Bibel K.P. Jantke Mathematical Methods of Specification and Synthesis of Software Systems, Lecture Notes in Computer Science Vol. 215 1986 Springer Berlin 9 23
20. J.A. Bergstra, C.A. Middelburg, Process algebra for hybrid systems, Computer Science Report 03-06, Department of Mathematics and Computer Science, Eindhoven University of Technology, June 2003.
21. J.A. Bergstra, C.A. Middelburg, Continuity controlled hybrid automata, Computer Science Report 04-11, Department of Mathematics and Computer Science, Eindhoven University of Technology, April 2004.
22. J.A. Bergstra, C.A. Middelburg, Located actions in process algebra with timing, Fund. Inform. 61 (3-4) (2004) 183-211.
23. J.A. Bergstra, C.A. Middelburg, and Y.S. Usenko Discrete time process algebra and the semantics of SDL J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier Amsterdam 1209 1268
24. A. Browder Mathematical Analysis An Introduction 1996 Springer Berlin
25. Z. Chaochen, C.A.R. Hoare, and A.P. Ravn A calculus of durations Inform. Process. Lett. 40 1991 269 276
26. Z. Chaochen, A.P. Ravn, and M.R. Hansen An extended duration calculus for hybrid real-time systems R.L. Grossman A. Nerode A.P. Ravn H. Rischel Hybrid Systems, Lecture Notes in Computer Science Vol. 736 1993 Springer Berlin 36 59
27. L. Chen An interleaving model for real-time systems A. Nerode M. Taitslin Symp. on Logical Foundations of Computer Science, Lecture Notes in Computer Science Vol. 620 1992 Springer Berlin 81 92
28. P.J.L. Cuijpers, M.A. Reniers, Topological (bi-)simulation, Computer Science Report 02-04, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, April 2001.
29. P.J.L. Cuijpers, M.A. Reniers, Hybrid process algebra, Computer Science Report 03-07, Department of Mathematics and Computer Science, Eindhoven University of Technology, July 2003.
30. J. Davies Timed CSP theory and practice J.W. de Bakker C. Huizing W.P. de Roever G. Rozenberg Real Time Theory and Practice, Lecture Notes in Computer Science Vol. 600 1992 Springer Berlin 640 675
31. R.J. van Glabbeek The linear time - branching time spectrum I J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier Amsterdam 3 99
32. J.F. Groote, and A. Ponse Process algebra with guards combining Hoare logic with process algebra Formal Aspects Comput. 6 2 1994 115 164
33. J.F. Groote, and J.J. van Wamel Analysis of three hybrid systems in timed μ CRL Sci. Comput. Programming 39 2/3 2001 215 247
34. M. Hennessy, and T. Regan A process algebra for timed systems Inform. Comput. 117 1995 221 239
35. T.A. Henzinger, The theory of hybrid automata, in: LICS'96, IEEE Computer Society Press, Los Altos, CA, 1996, pp. 278-292.
36. T.A. Henzinger Assume-guarantee reasoning for hierarchical hybrid systems M.D. Di Benedetto A. Sangiovanni-Vincentelli HSCC 2001, Lecture Notes in Computer Science Vol. 2034 2001 Springer Berlin 275 290
37. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi HyTech a model checker for hybrid systems Internat. J. Tools Technol. Transfer 1 1/2 1997 110 122
38. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi Algorithmic analysis of nonlinear hybrid systems IEEE Trans. Automat. Control 43 1998 278 292
39. T.A. Henzinger, B. Horowitz, R. Majumdar, and H. Wong-Toi Beyond HyTech hybrid systems analysis using interval numerical methods N. Lynch B.H. Krogh HSCC 2000, Lecture Notes in Computer Science Vol. 1790 2000 Springer Berlin 130 144
40. T.A. Henzinger, Z. Manna, and A. Pnueli Towards refining temporal specifications into hybrid systems R.L. Grossman A. Nerode A.P. Ravn H. Rischel Hybrid Systems, Lecture Notes in Computer Science Vol. 736 1993 Springer Berlin 60 76
41. H. Jifeng From CSP to hybrid systems A.W. Roscoe A Classical Mind Essays in Honour of C.A.R. Hoare 1994 Prentice-Hall Englewood Cliffs, NJ 171 189
42. N. Lynch, R. Segala, and F.W. Vaandrager Hybrid I/O automata Inform. Comput. 185 1 2003 105 157
43. C.A. Middelburg Truth of duration calculus formulae in timed frames Fund. Inform. 36 2/3 1998 235 263
44. C.A. Middelburg Variable binding operators in transition system specifications J. Logic Algebraic Programming 47 1 2001 15 45
45. C.A. Middelburg Process algebra with nonstandard timing Fund. Inform. 53 1 2002 55 77
46. C.A. Middelburg Revisiting timing in process algebra J. Logic Algebraic Programming 54 1/2 2003 109 127
47. C.A. Middelburg An alternative formulation of operational conservativity with binding terms J. Logic Algebraic Programming 55 1/2 2003 1 19
48. R. Milner Communicating and Mobile Systems The π -Calculus 1999 Cambridge University Press Cambridge
49. F. Moller, and C. Tofts A temporal calculus of communicating systems J.C.M. Baeten J.W. Klop CONCUR'90, Lecture Notes in Computer Science Vol. 458 1990 Springer Berlin 401 415
50. X. Nicollin, and J. Sifakis The algebra of timed processes ATP theory and application Inform. Comput. 114 1 1994 131 178
51. J. Quemada, D. de Frutos, and A. Azcorra TIC a timed calculus Formal Aspects Comput. 5 3 1993 224 252
52. W.C. Rounds, and Hosung Song The φ -calculus a language for distributed control of reconfigurable embedded systems O. Maler A. Pnueli HSCC 2003, Lecture Notes in Computer Science Vol. 2623 2003 Springer Berlin 435 449
53. J.J. Vereijken, A process algebra for hybrid systems, extended abstract of talk presented at Second European Workshop on Real-Time and Hybrid Systems, Grenoble, France, 1995.
54. J.J. Vereijken, Discrete time process algebra, Ph.D. Thesis, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, 1997.
55. W. Yi Real-time behaviour of asynchronous agents J.C.M. Baeten J.W. Klop CONCUR'90, Lecture Notes in Computer Science Vol. 458 1990 Springer Berlin 502 520