TPAP: An algebra of preemptive processes for verifying real-time systems with shared resources

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 6, 2002, Pages 68-85

  Ermont, Jérôme ^a   Boniol, Frédéric ^a  

^a ONERA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; BROADCASTING; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; FUNCTIONS; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SCHEDULING;

COMMUNICATION DELAYS; MODEL CHECKERS; SHARED RESOURCES; TIMED PROCESS ALGEBRA;

EMBEDDED SYSTEMS;

EID: 18944377418     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80470-5     Document Type: Conference Paper

References (17)

1. http://www.uppaal.com.
2. Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for real-time systems. In Proceedings of the 5th annual IEEE Symposium on Logic in Computer Science, Philadelphia, Pensylvania, 1990. IEEE Computer Society Press.
3. Rajeev Alur, David Dill L. A theory of timed automata. Theoretical Computer Science. 126:(2):1994;183-235
4. Baeten J.C.M., Bergstra J.A. Real Time Process Algebra. Formal Aspects of Computing. 3:(2):1991;142-188
5. Gerard Berry. Preemption in concurrent systems. Foundations of Software Technology and Theoretical Computer Science. 1993;72-93
6. F. Boniol, G. Bel, and J. Ermont. Modélisation et vérification de propriétés temps réel dans une architecture informatique distribuée asynchrone: étude de cas et approche comparative. In 9éme conférence internationale sur les systèmes temps réels RTS2001, mars 2001.
7. Brémond-Grégoire P., Lee I. A process algebra of communicating shared resources with dense time and priorities. Theoretical Computer Science. 189:1997
8. M. Buchholtz, J. Andersen, and H.H. Lovengreen. Towards a process algebra for shared resources. In 2nd International Workshop on Models for Time-Critical Systems, Aalborg, Danemark, August 2001.
9. P. D'Argenio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Department of Computer Science, University of Twente, 1999.
10. Harald Fecher. A real-time process algebra with open intervals and maximal progress. Nordic Journal of Computing. 8:(3):2001;346-365
11. Godskesen J., Larsen K. Real-time calculi and expansion theorems. Shyamasundar R. Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science. volume 652:1992;302-315 Springer Verlag
12. Guldstrand Larsen Kim, Pettersson Paul, Wang Yi. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer. 1:(1-2):1997;134-152
13. Guldstrand Larsen Kim, Wang Yi. Time-abstracted bisimulation: Implicit specifications and decidability. Information and Computation. 134:(2):1997;75-101
14. Milner R. Communication and Concurrency. 1989;Prentice Hall
15. C. Tofts F. Moller. A temporal calculus of communicating systems. In Proceedings of Concur'90, Lecture Notes in Computer Science, volume 458, pages 401-415. Springer-Verlag, 1990.
16. Nicollin X., Sifakis J. An overview and synthesis on timed process algebras. Larsen K.G., Skou A. 3rd. Computer-Aided Verification. July 1991;376-398 Springer-Verlag, LNCS 575
17. Nicollin X., Sifakis J. The algebra of timed processes ATP: Theory and application. Information and Computation. 114:(1):1994;131-178