Analysis of timed processes with data using algebraic transformations

In this paper, we outline a method to describe and analyze real-time systems using timed /spl mu/CRL. Most descriptions of such systems contain operators such as parallel composition that complicate analysis. As a first step towards the analysis of such systems, we linearize the given description using the algorithm from the work of Usenko (2002). The result is a timed linear process equation (TLPE) which is equivalent to the original description and has a very simple structure. Next, we outline how a TLPE can be transformed into an LPE, i.e., a linear process equation without time. This transformation, called time-free abstraction, has been used for non-recursive timed /spl mu/CRL processes in the work of Rieners et al. (2002). Crucial for this transformation is that the TLPE is transformed into a well-timed TLPE. Finally, all time-stamping is captured in the parameters of atomic actions. The result is an LPE for which the machinery of untimed /spl mu/CRL can be put to use for further analysis. These are based on symbolic analysis of the specifications, such as invariants, term rewriting and theorem proving, or on explicit state space generation and model-checking.

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

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

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

[4]  Jan Friso Groote,et al.  Invariants in Process Algebra with Data , 1993, CONCUR.

[5]  Jan Friso Groote,et al.  A Checker for Modal Formulas for Processes with Data , 2002 .

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

[7]  Jan Friso Groote,et al.  A Checker for Modal Formulae for Processes with Data , 2003, FMCO.

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

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

[10]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

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

[12]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[14]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[15]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[16]  Jan Friso Groote,et al.  The parallel composition of uniform processes with data , 2001, Theor. Comput. Sci..

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

[18]  J. F. Groote,et al.  Undecidability and completeness results for process algebras with alternative quantification over data , 1998 .

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

[20]  Jan Friso Groote,et al.  Analysis of three hybrid systems in timed µCRL , 2001, Sci. Comput. Program..

[21]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

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

[23]  Stanley Burris,et al.  The Elements of Universal Algebra , 1981 .

[24]  Mihaela Sighireanu,et al.  Efficient on-the-fly model-checking for regular alternation-free mu-calculus , 2003, Sci. Comput. Program..

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

[26]  J. Loeckx,et al.  Algebraic specification of abstract data types , 2001, Logic in Computer Science.