A timed LOTOS supporting a dense time domain and including new timed operators

A time extended version of LOTOS, denoted Timed LOTOS, is proposed for the modelling of quantitative timed behaviours. In this language neither the syntax nor the semantics are restricted to a specific time domain, i.e. a dense time domain is supported as well. Timed LOTOS incorporates a notion of urgency which is restricted to the internal actions. This is usually referred to as the maximal progress or minimum delay property. Timed LOTOS processes have also some pleasing properties such as the deadlock freeness property (i.e. processes can never stop the progression of time), and the persistency property (i.e. by idling, a process will not lose any capability of performing an action). In Timed LOTOS the delay operator is powerful because it allows the specification of a time interval in which the delay is nonderministically chosen. Two other powerful timed operators are defined which allow the expression of timed constraints on interactions, i.e. on actions involving several processes. The first one introduces a delay before the execution of any instance of a given action in a process. A second operator allows to start a time-out on any instance of a given action in a process, and to activate another process when such a time-out expires. The originality of these two operators is that they constrain interactions between processes, and support adequately a structured specification style. Keyword Codes: F.4.3; D.3.1; D.3.3

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

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

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

[4]  Ed Brinksma,et al.  Constraint-Oriented Specification in a Constructive Formal Description Technique , 1989, REX Workshop.

[5]  Guy Leduc,et al.  The Tick-Tock Case Study for the Assessment of Timed FDT's , 1994 .

[6]  Guy Leduc An Upward Compatible Timed Extension to LOTOS , 1991, FORTE.

[7]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

[8]  Matthew Hennessy,et al.  A Temporal Process Algebra , 1990, FORTE.

[9]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

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

[11]  Angel Fernández,et al.  Extending LOTOS towards performance evaluation , 1992, FORTE.

[12]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[13]  Tommaso Bolognesi,et al.  From timed Petri nets to timed LOTOS , 1990, PSTV.

[14]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.

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

[16]  Philip Wadler,et al.  A Syntax for Linear Logic , 1993, MFPS.

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

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

[19]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[20]  Tommaso Bolognesi,et al.  LOTOS-like Process Algebras with Urgent or Timed Interactions , 1991, FORTE.

[21]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[22]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[23]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[24]  George M. Reed,et al.  A Hierarchy of Domains for Real-Time Distributed Computing , 1990, Mathematical Foundations of Programming Semantics.

[25]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[26]  Jan Friso Groote,et al.  Specification and verification of real time systems in ACP , 1990, PSTV.

[27]  Hans A. Hansson Time and probability in formal design of distributed systems , 1991, DoCS.

[28]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.