Models and temporal logical specifications for timed component connectors

Component-based software engineering advocates construction of software systems through composition of coordinated autonomous components. Significant benefits of this approach include software reuse, simpler and faster construction, enhanced reliability, and dramatic reductions in the complexity of construction of provably correct critical systems, many of which involve real-time concerns. Effective, flexible component composition by itself still poses a challenge today and yet the special nature of real-time constraints makes component-based construction of real-time systems even more demanding. The coordination language Reo supports compositional system construction through connectors that exogenously coordinate the interactions among the constituent components which unawarely comprise a complex system, into a coherent collaboration. The simple, yet surprisingly rich, calculus of channel composition that underlies Reo offers a flexible framework for compositional construction of coordinating component connectors with real-time properties. In this paper, we present an operational semantics for the channel-based component connectors of Reo in terms of Timed Constraint Automata and introduce a temporal-logic for specification and verification of their real-time properties.

[1]  Guy Leduc,et al.  An Enhanced Version of Timed LOTOS and its Application to a Case Study , 1993, FORTE.

[2]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

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

[4]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[5]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

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

[7]  Nancy A. Lynch,et al.  Liveness in Timed and Untimed Systems , 1998, Inf. Comput..

[8]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[9]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[10]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[11]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[12]  Amir Pnueli,et al.  Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[13]  Robert K. Brayton,et al.  Verifying Abstractions of Timed Systems , 1996, CONCUR.

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

[15]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[17]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, JACM.

[18]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[19]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[20]  Mary K. Vernon,et al.  Timed Petri NetModel for PerformanceAnalysis , 1987 .

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

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

[23]  Pierre Wolper,et al.  Specification and synthesis of communicating processes using an extended temporal logic: (preliminary version) , 1982, POPL '82.

[24]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[25]  Nancy A. Lynch,et al.  A Framework for Modeling Timed Systems with Restricted Hybrid Automata , 2003, RTSS 2003.

[26]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[27]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[28]  Paul Caspi,et al.  Timed regular expressions , 2002, JACM.

[29]  Thomas A. Henzinger,et al.  Timed Interfaces , 2002, EMSOFT.

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

[31]  Farhad Arbab,et al.  A Coinductive Calculus of Component Connectors , 2002, WADT.

[32]  Joseph Sifakis.  Performance Evaluation of Systems Using Nets , 1979, Advanced Course: Net Theory and Applications.

[33]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[34]  Michael Merritt,et al.  Time-Constrained Automata (Extended Abstract) , 1991, CONCUR.

[35]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[36]  Christel Baier,et al.  Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract) , 2004, Electron. Notes Theor. Comput. Sci..