Timed CSP = closed timed automata

Electronic Notes in Theoretical Computer Science

Volumn 68, Issue 2, 2002, Pages 142-159

  Ouaknine, Joël ^a   Worrell, James ^a  

^a Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SEMANTICS; SET THEORY; SYNTACTICS; THEOREM PROVING;

CLOCK CONSTRAINTS; CLOSED TIME AUTOMATA; DIGITIZATION ANALYSIS; TIMED SYSTEMS;

FINITE AUTOMATA;

EID: 18944377412     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80369-X     Document Type: Conference Paper

References (27)

1. Alpern B., Schneider F.B. Defining liveness. Information Processing Letters. 21:(4):1985;181-185
2. Alur R., Courcoubetis C., Dill D. Model-checking for real-time systems. Proceedings of LICS 90. 1990;414-425 IEEE Computer Society Press
3. Alur R., Courcoubetis C., Dill D. Model-checking in dense real-time. Information and Computation. 104:(1):1993;2-34
4. Alur R., Dill D. A theory of timed automata. Theoretical Computer Science. 126:1994;183-235
5. Alur R., Fix L., Henzinger T.A. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science. 211:1999;253-273
6. Alur R., Henzinger T.A. Real-time logics: Complexity and expressiveness. Information and Computation. 104:(1):1993;35-77
7. Asarin E., Maler O., Pnueli A. On discretization of delays in timed automata and digital circuits. Proceedings of CONCUR 98. Springer LNCS. volume 1466:1998;470-484
8. Bos̃nac̃ki D. Digitization of timed automata. Proceedings of FMICS 99. 1999
9. Chapman R., Goldsmith M. Translating timer automata to TCSP. Formal Systems Design and Development, Inc. 1995
10. Clarke E.M., Grumberg O., Peled D.A. Model Checking. 1999;MIT Press, Cambridge, MA
11. Davies J. Specification and Proof in Real-Time Systems. 1991;PhD thesis, Oxford University
12. Henzinger T.A., Manna Z., Pnueli A. What good are digital clocks? In. Proceedings of 1C ALP 92. Springer LNCS. volume 623:1992;545-558
13. Henzinger T.A., Nicollin X., Sifakis J., Yovine S. Symbolic model checking for real-time systems. Information and Computation. 111:(2):1994;193-244
14. Jackson D.M. Logical Verification of Reactive Software Systems. 1992;PhD thesis, Oxford University
15. Leuschel M., Massart T., Currie A. How to make FDR Spin: LTL model checking using refinement. In Proceedings of FME 01. Springer LNCS. volume 2021:2001;99-118
16. Ouaknine J. Discrete Analysis of Continuous Behaviour in Real-Time Concurrent Systems. 2001;PhD thesis, Oxford University. Technical report PRG-RR-01-06
17. Ouaknine J. Digitisation and full abstraction for dense-time model checking. In Proceedings of TACAS 02. Springer LNCS. volume 2280:2002;37-51
18. Ouaknine J., Worrell J.B. Some decidability and undecidability results for timed automata. Submitted. 2002;. www.math.tulane.edu/~joelo
19. Ouaknine J., Worrell J.B. Towards specification as refinement in timed systems. Proceedings of AVoCS 02. 2002;The University of Birmingham
20. Phillips I. Refusal testing. Theoretical Computer Science. 50:(3):1987;241-284
21. G. M. Reed. A Mathematical Theory for Real-Time Distributed Computing. PhD thesis, Oxford University, 1988.
22. Reed G.M., Roscoe A.W. A timed model for communicating sequential processes. Proceedings of ICALP 86. 1986;314-323 Springer LNCS. Theoretical Computer Science, 58:249-261
23. Reed G.M., Roscoe A.W. The timed failures-stability model for CSP. Theoretical Computer Science. 211:1999;85-127
24. Schneider S.A. Correctness and Communication in Real-Time Systems. 1989;PhD thesis, Oxford University
25. Schneider S.A. Using CSP with Z in the mine pump case study. Unpublished. 1994
26. Schneider S.A. An operational semantics for Timed CSP. Information and Computation. 116:1995;193-213
27. Schneider S.A. Concurrent and Real Time Systems: the CSP approach. 2000;John Wiley