On specifying real-time systems in a causality-based setting

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

Volumn 1135, Issue , 1996, Pages 385-404

  Katoen, Joost Pieter ^a   Langerak, Rom ^a   Latella, Diego ^b   Brinksma, Ed ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; INTERACTIVE COMPUTER SYSTEMS; SEMANTICS;

CAUSAL DEPENDENCIES; DENOTATIONAL SEMANTICS; EVENT STRUCTURES; OPERATIONAL SEMANTICS; PROCESS ALGEBRAS; REAL-TIME EVENT STRUCTURES; TEMPORAL MODELING; TIME CONSTRAINTS;

REAL TIME SYSTEMS;

EID: 84947765562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61648-9_52     Document Type: Conference Paper

References (28)

1. L. Aceto & D. Murphy. On the ill-timed but well-caused. In E. Best, ed, Concur' 93, LNCS 715: 97-111. Springer-Verlag, 1993.
2. R. Alur & D.L. Dill. A theory of timed automata. Th. Comp. Sci., 126:183-235, 1994.
3. J.C.M. Baeten & J.A. Bergstra. Real time process algebra. Formal Aspects of Uomputing, 3(2):142-188, 1991.
4. T. Bolognesi ~ E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25-59, 1987.
5. G. Boudol & I. Castellani. Flow models of distributed computations: three equivalent semantics for CCS. Inf. & Comp., 114: 247-314, 1994.
6. E. Brinksma, J.-P. Katoen, It. Langerak & D. Latella. Performance analysis and true concurrency semantics. In T. Rus & C. Itattray, eds, Theories and Ezperiences for Real-Time System Development, pp. 309-337. World Scientific, 1994.
7. R.T. Casley, It.F. Crew, J. Meseguer & V.R. Pratt. Temporal structures. Mathematical Structures in Computer Science, 1(2):179-213, 1991.
8. J.W. de Bakker, W.-P. de Roever & G. Rozenberg, eds. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer-Verlag, 1989.
9. M. Diaz & R. Groz, eds. Formal Description Techniques V. North-Holland, 1993.
10. C. Fidge. A constraint-oriented real-time process calculus. In [9], pp. 363-378.
11. R. Gorrieri, M. Itoccetti & E. Stancampiano. A theory of processes with durational actions. Th. Camp. Sci., 140:73-94, 1995.
12. J. Gtmawardena. A dynamic approach to timed behaviour. In B. Jonsson & J. Parrow, eds, Concur' 94: Concurrency Theory, LNCS 836: 178-193. Springer-Verlag, 1994.
13. W. Janssen, M. Poel, Q. Wu & J. Zwiers. Layering of real-time distributed processes. In H. Langmaack, W.-P. de Roever & J. Vytopil, Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863: 393-417. Springer-Verlag, 1994.
14. J.-P. Katoen. Quantitative and Qualitative Extensions of Event Structures. PhD thesis, University of Twente, 1996.
15. J.-P. Katoen, R. Langerak & D. Latella. Modelling systems by probabilistic process algebra: An event structures approach. In R.L. Tenney, P.D. Amer & M.Ü. Uyar, eds, Formal Description Techniques VI, pp. 253-268. North-Holland, 1994.
16. J.-P. Katoen, D. Latella, R. Langerak, E. Brinksma & T. Bolognesi. A consistent eansality-based view on a timed process algebra. In A. Cornell & D. Ioneseu, eds, Proc. 3rd Amast Workshop on Real-Time System Development, pp. 212-227, 1996.
17. R. Langerak. Bundle event structures: a non-interleaving semantics for LOTOS. In [9], pp. 331-346.
18. A. Maggiolo-Schettini & J. Winkowski. Towards an algebra for timed behaviours. Th. Camp. Sci., 103:335-363, 1992.
19. A. Mazurkiewicz. Basic notions of trace theory. In [8], pp. 285-363.
20. D.V.J. Murphy. Time and duration in noninterleaving concurrency. Fund. Inf., 19:403-416, 1993.
21. X. Nicollin & J. Sifakis. An overview and synthesis on timed process algebras. In J.W. de Bakker et al, eds, Real-Time: Theory in Practice, LNCS 600: 526-548. Springer-Verlag, 1992.
22. G.M. Pinna & A. Ponna. On the nature of events: another perspective in concurrency. Th. Camp. Sci., 138(2):425-454, 1995.
23. G.D. Plotkin. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
24. V.R. Pratt. Modeling concurrency with partial orders. Int. J. of Parallel Protramming, 15(1):33-71, 1986.
25. J. Quemada, D. de Frutos & A. Azcorra. TIC: A Timed Calculus. Formal Aspects of Computing, 5:224-252, 1993.
26. D.A. Schmidt. Denotational Semantics: a methodology for language development. Allyn & Bacon, 1986.
27. G. Winskel. An introduction to event structures. In [8], pp. 364-397.
28. J.J. Žic. Time-constrained buffer specifications in CSP+T and timed CSP. ACM Transactions on Programming Languages and Systems, 16(6):1661-1674, 1994.