Timed verification with μCRL

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

Volumn 2890, Issue , 2003, Pages 178-191

  Blom, Stefan ^a   Ioustinova, Natalia ^a   Sidorova, Natalia ^b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

CRL; Discrete time; Model checking; Modelling; Verification

Indexed keywords

COMPUTATIONAL LINGUISTICS; MODELS; SEMANTICS; VERIFICATION;

ALGEBRAIC LANGUAGES; DISCRETE TIME; DISTRIBUTED SYSTEMS; EXPERIMENTAL VERIFICATION; IS-ENABLED; SPECIFICATION AND VERIFICATION; TEMPORAL PROPERTY; TIME PROGRESS;

MODEL CHECKING;

EID: 25144446921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (15)

1. R. Alur. Timed Automata. In Proceedings of CAV '99, volume 1633 of Lecture Notes in Computer Science, pages 8-22. Springer-Verlag, 1999.
2. J. C. M. Baeten and J. A. Bergstra. Discrete time process algebra. Formal Aspects of Computing, 8(2):188-208, 1996.
3. J. C. M. Baeten and C. A. Middelburg. Process Algebra with Timing: Real Time and Discrete Time. In Bergstra et al. [4].
4. J. A. Bergstra, A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. Elsevier, 2001.
5. S. C. C. Blom, W. J. Fokkink, J. F. Groote, I. A. van Langevelde, B. Lisser, and J. C. van de Pol. μCRL: a toolset for analysing algebraic specifications. In G. Berry, H. Comon, and A. Finkel, editors, Proceedings 13th Conference on Computer Aided Verification (CAV'01), Paris, France, volume 2102 of Lecture Notes in Computer Science, pages 250-254. Springer-Verlag, 2001.
6. D. Bošnački and D. Dams. Integrating real time into Spin: A prototype implementation. In S. Budkowski, A. Cavalli, and E. Najm, editors, Proceedings of Formal Description Techniques and Protocol Specification, Testing, and Verification. Kluwer Academic Publishers, 1998.
7. M. Bozga, O. Maler, and S. Tripakis. Efficient verification of timed automata using dense and disrete time semantics. In T. Kropf and L. Pierre, editors, Proc. CHARME'99, volume 1703 of Lecture Notes in Computer Science, pages 125-141. Springer, September 1999.
8. J. F. Groote and M. Reniers. Algebraic, process verification. In Bergstra et al. [4], pages 1151-1208.
9. J. F. Groote and J. J. van Wamel. Analysis of three hybrid systems in timed μCRL. Science of Computer Programming, 39:215-247, 2001.
10. J. F. Groote. The syntax and semantics of timed μCRL. SEN R9709, CWI, Amsterdam, 1997.
11. T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In W. Kuich, editor, ICALP, volume 623 of Lecture Notes in Computer Science, pages 545-558. Springer, 1992.
12. R. Mateescu and M. Sighireanu. Efficient on-the-fly model-checking for regular alternation-free mu-calculus. In Proceedings of the 5th International Workshop on Formal Methods for Industrial Critical Systems, FMICS'2000, 2000.
13. R. D. Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the ACM(JACM), 42(2):458-487, 1996.
14. ObjectGeode 4. http://www.csverilog.com/products/geode.htm, 2000.
15. A. S. Tanenbaum. Computer Networks. Prentice Hall International, Inc., 1981.