Actions Duration in Timed Models

This paper introduces a realtime model based on a trueconcurrency semantics, expressing parallel behaviors and supporting at the same time timing constraints, explicit actions durations, structural and temporal nonatomicity of actions and urgency. This model is called Durational Action Timed Automata*. As an application, we propose translating rules from D� LOTOS language specifications to DATA*'s structures.

[1]  Celso A. S. Santos,et al.  Experience with RT-LOTOS, a temporal extension of the LOTOS formal description technique , 2000, Comput. Commun..

[2]  Ouassila Labbani,et al.  Maximality-based symbolic model checking , 2003 .

[3]  Jean-Pierre Courtiat,et al.  A Reachability Analysis of RT-LOTOS Specifications , 1995, FORTE.

[4]  Joseph Sifakis,et al.  Modeling Urgency in Timed Systems , 1997, COMPOS.

[5]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[6]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[7]  Djamel-Eddine Saïdouni,et al.  Relating maximality-based semantics to action refinement in process algebras , 1994, FORTE.

[8]  Thomas A. Henzinger,et al.  Event-Clock Automata: A Determinizable Class of Timed Automata , 1999, Theor. Comput. Sci..

[9]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[10]  Djamel-Eddine Saïdouni,et al.  Using Maximality-Based Labeled Transition System Model for Concurrency Logic Verification , 2005, Int. Arab J. Inf. Technol..

[11]  Patricia Bouyer,et al.  Are Timed Automata Updatable? , 2000, CAV.

[12]  Joseph Sifakis,et al.  On the Composition of Hybrid Systems , 1998, HSCC.

[13]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

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

[15]  Raymond R. Devillers.  Maximality Preserving Bisimulation , 1992, Theor. Comput. Sci..

[16]  Laurent Fribourg,et al.  Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol , 1999, CAV.

[17]  Patricia Bouyer-Decitre.  Modèles et algorithmes pour la vérification des systèmes temporisés , 2002 .

[18]  François Vernadat,et al.  Covering Step Graph , 1996, Application and Theory of Petri Nets.

[19]  Pierre-Olivier Ribet.  Vérification formelle de systèmes. Contribution à la réduction de l'explosion combinatoire , 2005 .

[20]  Guy Leduc,et al.  An Introduction to ET-LOTOS for the Description of Time-Sensitive Systems , 1997, Comput. Networks ISDN Syst..

[21]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[22]  Raymond R. Devillers.  Maximality preservation and the ST-idea for action refinements , 1992, Advances in Petri Nets: The DEMON Project.

[23]  Roberto Barbuti,et al.  Timed Automata with non-Instantaneous Actions , 2001, Fundam. Informaticae.

[24]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..