Automatic translation of a timed process algebra into dynamic state graphs

In this paper we consider a timed process algebra based on classical LOTOS operators in order to specify the behaviour of concurrent systems and, concretely, those systems for which time becomes an important factor to take into account, such as real-time systems. One of the main goals of this paper is to define a translation into a kind of dynamic state graph, which is currently supported by a tool (TPAL), which allows it to simulate the execution of a specification by means of these dynamic state graphs.

[1]  Sitaram C. V. Raju.  An Automatic Verification Technique for Communicating Real-Time State Machines , 1993 .

[2]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[3]  Joseph Sifakis,et al.  From ATP to Timed Graphs and Hybrid Systems , 1991, REX Workshop.

[4]  Alan C. Shaw,et al.  Communicating Real-Time State Machines , 1992, IEEE Trans. Software Eng..

[5]  Farnam Jahanian,et al.  A Method for Verifying Properties of Modechart Specifications , 1988, RTSS.

[6]  Jonathan S. Ostroff,et al.  Deciding Properties of Timed Transition Models , 1990, IEEE Trans. Parallel Distributed Syst..

[7]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[8]  David de Frutos-Escrig,et al.  TIC: A Timed Calculus for LOTOS , 1989, Formal Techniques for (Networked and) Distributed Systems.

[9]  Aloysius K. Mok,et al.  Specification and Analysis of Real-Time Systems: Modechart Language and Toolset , 1995 .

[10]  Hans A. Hansson,et al.  Modeling Timeouts and Unreliable Media with a Timed Probabilistic Calculus , 1991, FORTE.

[11]  Insup Lee,et al.  An Efficient Generation of the Timed Reachability Graph for the Analysis of Real-Time Systems , 1994 .

[12]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[13]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[14]  Tommaso Bolognesi,et al.  Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator , 1991, REX Workshop.

[15]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..