Achieving discrete relative timing with untimed process algebra

Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS

Volumn , Issue , 2007, Pages 35-44

  Wijs, A J ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

TIMING CIRCUITS;

DELAY STEPS; MODELING TIMING; PROCESS ALGEBRAS; RELATIVE TIMING; TIMED PROCESS ALGEBRA; TIMING ASPECTS;

ALGEBRA;

EID: 46749135199     PISSN: 27708527     EISSN: 27708535     Source Type: Conference Proceeding    
DOI: 10.1109/ICECCS.2007.13     Document Type: Conference Paper

References (24)

1. J.C.M. Baeten. Embedding untimed into timed process algebra: the case of explicit termination. Math. Struct. in Comp. Science, 13(4):589-618, 2003.
2. J.C.M. Baeten and C.A. Middelburg. Process Algebra with Timing. EATCS Monograph. Springer, 2002.
3. D.A. van Beek, K.L. Man, M.A. Reniers, J.E. Rooda, and R.R.H. Schiffelers. Syntax and Semantics of Timed Chi. CS-Report 05-09, Eindhoven University of Technology, 2005.
4. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1-3):109-137, 1984.
5. S.CC. Blom, W.J. Fokkink, J.F. Groote, I. van Langevelde, B. Lisser, and J.C. van de Pol. μCRL: A Toolset for Analysing Algebraic Specifications. In Proc. CAV'01, volume 2102 of LNCS, pages 250-254, 2001.
6. S.C.C. Blom, N. Ioustinova, and N. Sidorova. Timed verification with μCRL. In Proc. PSI 2003, volume 2890 of LNCS, pages 178-192, 2003.
7. J.-C. Fernandez, H. Garavel, A. Kerbrat, L. Mounier, R. Mateescu, and M. Sighireanu. CADP - a protocol validation and verification toolbox. In Proc. CAV'96, volume 1102 of LNCS, pages 437-440, 1996.
8. W.J. Fokkink, J.F. Groote, J. Pang, B. Badban, and J.C. van de Pol. Verifying a Sliding Window Protocol in μCRL. In Proc. AMAST 2004, volume 3116 of LNCS, pages 148-163, 2004.
9. W.J. Fokkink, J. Pang, and A.J. Wijs. Is Timed Branching Bisimilarity an Equivalence Indeed? In Proc. FORMATS'05, volume 3829 of LNCS, pages 258-272, 2005.
10. R.J. van Glabbeek and W.P. Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM, 43(3):555-600, 1996.
11. J.F. Groote. The Syntax and Semantics of timed μCRL. Technical Report SEN-R9709, CWI, 1997.
12. J.F. Groote, F. Monin, and J.C. van de Pol. Checking verifications of protocols and distributed systems by computer. In Proc. CONCUR '98, volume 1466 of LNCS, pages 629-655, 1998.
13. J.F. Groote and A. Ponse. The syntax and semantics of μCRL. In Proc. ACP'94, Workshops in Computing Series, pages 26-62. Springer, 1995.
14. N. Ioustinova. Abstractions and Static Analysis for Verifying Reactive Systems. PhD thesis, Vrije Universiteit Amsterdam, 2004.
15. J. Loeckx, H.-D. Ehrich, and M. Wolf. Specification of Abstract Data Types. Wiley-Teubner, Chichester, Stuttgart, 1996.
16. S.P. Luttik. Choice Quantification in Process Algebra. PhD thesis, University of Amsterdam, 2002.
17. X. Nicollin and J. Sifakis. An Overview and Synthesis on Timed Process Algebras. In CAV'91, volume 575 of LNCS, pages 376-398, 1991.
18. S. Owre, J.M. Rushby, and N. Shankar. PVS: a Prototype Verification System. In Proc. CADE'92, volume 607 of LNCS, pages 748-752, 1992.
19. D. Peled, V. Pratt, and G. Holzmann, editors. Partial Order Methods in Verification, volume 29 of DIMACS series in discrete mathematics and theoretical computer science. AMS, 1996.
20. I. Ulidowski and S. Yuen. Extending Process Languages with Time. In Proc. AMAST'97, volume 1349 of LNCS, pages 524-538, 1997.
21. Y.S. Usenko. Linearization in μCRL. PhD thesis, Eindhoven University of Technology, 2002.
22. t to μCRL: Combining Performance and Functional Analysis. In Proc. ICECCS'05, pages 184-193. IEEE Computer Society Press, 2005.
23. A.G. Wouters. Manual for the μCRL tool set. Technical Report SEN-R0130, CWI, 2001.
24. M.B. van der Zwaag. Models and Logics for Process Algebra. PhD thesis, University of Amsterdam, 2002.