## Compiling Real-Time Specifications into Extended Automata (1992)

Venue: | IEEE Transactions on Software Engineering |

Citations: | 77 - 8 self |

### BibTeX

@ARTICLE{Nicollin92compilingreal-time,

author = {Xavier Nicollin and Joseph Sifakis and Sergio Yovine},

title = {Compiling Real-Time Specifications into Extended Automata},

journal = {IEEE Transactions on Software Engineering},

year = {1992},

volume = {18},

pages = {794--804}

}

### Years of Citing Articles

### OpenURL

### Abstract

We propose a method for the implementation and analysis of real-time systems, based on the compilation of specifications into extended automata. Such a method has been already adopted for the so called "synchronous" real-time programming languages.

### Citations

1237 | Automatic verification of finite-state concurrent systems using temporallogic specificaitons - Clarke, Emerson, et al. - 1986 |

1132 | Computer Networks - Tanenbaum - 2003 |

837 | Design and synthesis of synchronization skeletons using branching-time temporal logic - Clarke, Emerson - 1982 |

505 | Symbolic model checking for real-time systems
- Henzinger, Nicollin, et al.
- 1994
(Show Context)
Citation Context ...automata. Furthermore, properties expressed in a real-time temporal logic like TCTL [Alu91] can be verified by standard model-checking [ACD90, Alu91] or by applying symbolic model-checking techniques =-=[HNSY92]-=-. This paper is organized as follows. In Section 2, we describe a model for abstract time. In Section 3, we propose the specification language and the underlying operational semantics. An example of a... |

262 | LUSTRE: a declarative language for programming synchronous systems
- Caspi, Halbwachs, et al.
- 1987
(Show Context)
Citation Context ...m is highly dependent on the compiler and the hardware. To meet the requirements for a rigorous development method, a new family of synchronous programming languages have been proposed, namely Lustre =-=[CHPP87]-=-, Esterel [BC85], Signal [GBBG85] and Statecharts [Har87]. These languages adopt precise timing assumptions. All components are driven by a common global clock. The duration between two successive clo... |

254 | A really temporal logic - Alur, Henzinger - 1989 |

250 | Specification and verification of concurrent systems is CESAR - Queille, Sifakis - 1982 |

159 |
Statecharts: A Visual Approach to Complex Systems
- Harel
- 1987
(Show Context)
Citation Context ... meet the requirements for a rigorous development method, a new family of synchronous programming languages have been proposed, namely Lustre [CHPP87], Esterel [BC85], Signal [GBBG85] and Statecharts =-=[Har87]-=-. These languages adopt precise timing assumptions. All components are driven by a common global clock. The duration between two successive clock ticks is chosen as the time unit, and a program run is... |

147 | An Overview and Synthesis on Timed Process Algebras
- Nicollin, Sifakis
- 1991
(Show Context)
Citation Context ...NS90, NSY91, Nic92]. ATP is extensively studied in [NS90] and more recently in [Nic92], where a complete and sound axiomatization is provided. ATP is compared with other real-time process algebras in =-=[NS91]-=-. 3.1 Syntax and semantics Let P roc be a set of names for processes. The syntax of the language is defined by the following grammar: S ::= spec Y 1 eqns Y 1 = P 1 ; 1 1 1 ; Yn = Pn comm a 1 ja 2 = a ... |

109 | The algebra of timed processes, ATP: Theory and application
- Nicollin, Sifakis
- 1994
(Show Context)
Citation Context ...ion language In this section we define the syntax and semantics of our specification language which is a version of the process algebra ATP [NRSV90, NS90, NSY91, Nic92]. ATP is extensively studied in =-=[NS90]-=- and more recently in [Nic92], where a complete and sound axiomatization is provided. ATP is compared with other real-time process algebras in [NS91]. 3.1 Syntax and semantics Let P roc be a set of na... |

106 | Temporal Logic For Real-Time Systems - Ostroff - 1989 |

96 |
The ESTEREL synchronous programming language and its mathematical semantics. volume 197
- Berry, Cosserat
- 1984
(Show Context)
Citation Context ...ent on the compiler and the hardware. To meet the requirements for a rigorous development method, a new family of synchronous programming languages have been proposed, namely Lustre [CHPP87], Esterel =-=[BC85]-=-, Signal [GBBG85] and Statecharts [Har87]. These languages adopt precise timing assumptions. All components are driven by a common global clock. The duration between two successive clock ticks is chos... |

94 | Symbolic model checking: states and beyond - Burch, Clarke, et al. - 1992 |

90 |
Techniques for automatic verification of real-time systems
- Alur
- 1991
(Show Context)
Citation Context ...r of ticks between them. Modeling asynchronous systems requires dense-time domains allowing events to happen arbitrarily close to each other. The need of a dense-time model has been well discussed in =-=[Alu91]-=-. It comes out that when analyzing asynchronous systems the results obtained in the dense-time model differ from those in discrete-time [Alu91, NSY91]. Our aim is to show that the approach adopted for... |

88 | Specifying Message Passing and Time-Critical Systems with Temporal Logic - Koymans - 1992 |

81 | S.: From ATP to timed graphs and hybrid systems - Nicollin, Sifakis, et al. - 1993 |

53 | A Graph-Theoretic Approach for Timing Analysis in Real-Time Logic - Jahanian, Mok - 1986 |

48 | Logics and Models of Real-Time: A Survey - Alur, Henzinger - 1992 |

39 | Applications of Temporal Logic to the Specification of Real Time Systems - Pnueli, Harel - 1988 |

37 |
Signal: A data-flow oriented language for signal processing
- Guernic, Benveniste, et al.
- 1986
(Show Context)
Citation Context ...iler and the hardware. To meet the requirements for a rigorous development method, a new family of synchronous programming languages have been proposed, namely Lustre [CHPP87], Esterel [BC85], Signal =-=[GBBG85]-=- and Statecharts [Har87]. These languages adopt precise timing assumptions. All components are driven by a common global clock. The duration between two successive clock ticks is chosen as the time un... |

30 | ATP, an algebra for timed processes - Nicollin, Richier, et al. |

25 |
Verifying a CSMA/CD-protocol with CCS
- Parrow
- 1988
(Show Context)
Citation Context ...ical worst case round trip propagation delay of 51:2s, we set 2oe to be 51:2s and for standard frames of 1024 bytes,sis approximately 782s. A specification of a CSMA/CD protocol using CCS is given in =-=[Par86]-=-, where only the untimed behavior is modeled. Timing constraints are modeled in [Han91], where a simplified discrete-time version is provided. Here we specify a CSMA/CD protocol by focusing on timing ... |

15 |
Model-Checking for Real Time Systems
- Alur, Courcoubetis, et al.
- 1990
(Show Context)
Citation Context ...ance [JM87, PH88, AH89, Koy89, Ost90, ACD90, Alu91, HNSY92]. We consider the real-time temporal logic TCTL, an extension of CTL where temporal operators have subscripts that limit their scope in time =-=[ACD90]-=-. CTL [EC81, CES86] is a branching-time temporal logic which proposes two binary temporal operators 9U and 8U , corresponding to reachability modalities. A formula represents a set of program states s... |

15 |
Compilation et vérification de programmes LOTOS. Thèse de Doctorat
- Garavel
- 1989
(Show Context)
Citation Context ...translated into timed automata. A stepwise transformation scheme is applied instead. This approach has been successfully implemented before for generating transition systems from LOTOS specifications =-=[Gar89]-=-. The compilation method uses an intermediate model, called graph of timers, which is described by a finite set of timers (the nodes), a finite set of edges coding relations between timers and a set o... |

4 |
Time and Probability in Formal Design of Distributed Systems
- Hanson
- 1991
(Show Context)
Citation Context ...tandard frames of 1024 bytes,sis approximately 782s. A specification of a CSMA/CD protocol using CCS is given in [Par86], where only the untimed behavior is modeled. Timing constraints are modeled in =-=[Han91]-=-, where a simplified discrete-time version is provided. Here we specify a CSMA/CD protocol by focusing on timing constraints. For simplicity, we suppose that only two stations are connected and that a... |

3 |
ATP: une alg ebre pour la sp ecification et l'analyse des syst emes temps r eel
- Nicollin
- 1992
(Show Context)
Citation Context ... we define the syntax and semantics of our specification language which is a version of the process algebra ATP [NRSV90, NS90, NSY91, Nic92]. ATP is extensively studied in [NS90] and more recently in =-=[Nic92]-=-, where a complete and sound axiomatization is provided. ATP is compared with other real-time process algebras in [NS91]. 3.1 Syntax and semantics Let P roc be a set of names for processes. The syntax... |

2 |
The specification of aircraft engine control software using Timed CSP
- Jackson
- 1989
(Show Context)
Citation Context ...the examples considered appear to be satisfactory. The results obtained for CSMA/CD protocol, the login procedure [NS90], the alternating bit protocol [Tan89, NS90], and an aircraft engine controller =-=[Jac89]-=- are shown in table 1. The first two columns are the running times (measured in seconds) for constructing the graph of timers and generating the automaton. These results were obtained on a SUN 4 Sparc... |

1 |
Graph of timers: an approach to translate ATP into timed graphs
- Yovine
- 1991
(Show Context)
Citation Context ... analysis techniques strongly depend on this parameter [ACD90, Alu91, HNSY92]. For this reason, we have developed a compilation scheme, based on an efficient algorithm for constructing timed automata =-=[Yov91]-=-. Designing and writing an efficient compiler requires a decomposition and analysis of the translation which are not described by the rules. The main idea of the method is to discover the relations th... |