by Yonit Kesten, Zohar Manna, Amir Pnueli
Acta Informatica
http://www.wisdom.weizmann.ac.il/~amir/cts-comb-main.ps.gz
Add To MetaCart
Abstract:
Abstract. This paper presents a new computational model for realtime systems, called the clocked transition system (cts) model. The cts model is a development of our previous timed transition model, where some of the changes are inspired by the model of timed automata. The new model leads to a simpler style of temporal specification and verification, requiring no extension of the temporal language. We present verification rules for proving safety properties (including time-bounded response properties) of clocked transition systems, and separate rules for proving (time-unbounded) response properties. All rules are associated with verification diagrams. The verification of response properties requires adjustments of the proof rules developed for untimed systems, reflecting the fact that progress in the real time systems is ensured by the progress of time and not by fairness. The style of the verification rules is very close to the verification style of untimed systems which allows the (re)use of verification methods and tools, developed for untimed reactive
Citations
|
1713
|
Statecharts: A visual formalism for complex systems
– Harel
- 1987
|
|
1393
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
449
|
The algorithmic analysis of hybrid systems
– Alur, Courcoubetis, et al.
- 1995
|
|
296
|
Temporal Verification of Reactive Systems: Safety
– Manna, Pnueli
- 1995
|
|
221
|
An old-fashioned recipe for real time
– Abadi, Lamport
- 1992
|
|
189
|
A really temporal logic
– Alur, Henzinger
|
|
162
|
Logics and models of real time: A survey
– Alur, Henzinger
- 1992
|
|
131
|
The temnporal logic of branching time
– Ben-Ari, Manna, et al.
- 1983
|
|
128
|
From timed to hybrid systems
– Maler, Manna, et al.
- 1991
|
|
121
|
Using branching time temporal logic to synthesis synchronization skeletons
– Emerson, Clarke
- 1982
|
|
121
|
A user guide to HyTech
– Henzinger, Ho, et al.
- 1995
|
|
113
|
Specifying real-time properties with metric temporal logic
– Koymans
- 1990
|
|
72
|
Completing the temporal picture
– Manna, Pnueli
- 1991
|
|
68
|
Verifying hybrid systems
– Manna, Pnueli
- 1993
|
|
56
|
Temporal verification diagrams
– Manna, Pnueli
- 1994
|
|
54
|
Models for reactivity
– Manna, Pnueli
- 1993
|
|
44
|
Temporal proof methodologies for timed transition systems
– Henzinger, Manna, et al.
- 1994
|
|
30
|
Realtime programming and asynchronous message passing
– Koymans, Vytopil, et al.
- 1984
|
|
25
|
Deductive Verification of Real-time Systems Using Step
– Bjrner, Manna, et al.
- 1997
|
|
24
|
Sooner is safer than later
– Henzinger
- 1992
|
|
22
|
Real-time system = discrete system + clock variables. STTT
– Alur, Henzinger
- 1997
|
|
15
|
Deductive verification of hybrid systems using STeP
– Manna, Sipma
- 1998
|
|
12
|
Examples of a real-time temporal logic specifications
– Koymans, Roever
- 1985
|
|
11
|
The temporal logic of reactive systems
– Manna, Pnueli
- 1991
|
|
9
|
Verification of temporal properties
– Fix, Grumberg
- 1996
|
|
8
|
Verification methods for the Divergent Runs of Clock Systems
– Henzinger, Kopke
- 1994
|
|
1
|
Proving possibiity properties
– Lamport
- 1995
|
