Time abstraction in timed µCRL à la regions

We present the first step towards combining the best parts of the real-time verification methods based on timed automata (the use of regions and zones), and of the process-algebraic approach of languages like LOTOS and /spl mu/CRL. This could provide with additional verification possibilities for real-time systems, not available in existing timed-automata-based tools like UPPAAL. We aim to transfer the successful techniques of regions and zones as used for the analysis of timed automata to the realm of timed /spl mu/CRL. First, we aim at replacing all parameters of sort time occurring in the resulting process equation by parameters of discrete sorts. To achieve this goal we apply process-algebraic transformations and abstraction techniques to the given process equation. As a result we obtain a process equation that is closely related to the given one in the following sense. If we abstract from the fractional parts of the time stamps in the actions, both of the equations will be timed bisimilar.

[1]  Jan Friso Groote,et al.  Algebraic Process Verification , 2001, Handbook of Process Algebra.

[2]  J. F. Groote.  The Syntax and Semantics of timed μ CRL , 1997 .

[3]  Jan Friso Groote,et al.  Computer assisted manipulation of algebraic process specifications , 2002, SIGP.

[4]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[5]  Ys Yaroslav Usenko,et al.  Linearization in muCRL , 2002 .

[6]  Jan Friso Groote,et al.  Algebraic Data Types and Induction in CRL , 2007 .

[7]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[8]  Jan Friso Groote,et al.  Completeness of Timed μCRL , 2002 .

[9]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[10]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[11]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[12]  Tac Tim Willemse.  Semantics and verification in process algebras with data and timing , 2003 .

[13]  Jan A. Bergstra,et al.  Algebraic specification , 1989 .

[14]  Michel A. Reniers,et al.  Analysis of timed processes with data using algebraic transformations , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[15]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

[16]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[17]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[18]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .

[19]  Yong Sun.  An Algebraic Generalization of Frege Structures-Binding Algebras , 1999, Theor. Comput. Sci..

[20]  Jan F Groote.  The syntax and semantics of timed $\mu CRL$ , 1997 .

[21]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[22]  Rajeev Alur,et al.  Timed Automata , 1999, CAV.