1995
DOI: 10.1007/978-1-4612-4222-2
|View full text |Cite
|
Sign up to set email alerts
|

Temporal Verification of Reactive Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
653
0
3

Year Published

1998
1998
2018
2018

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 862 publications
(657 citation statements)
references
References 0 publications
1
653
0
3
Order By: Relevance
“…Alternative methods for temporal analysis of reactive systems are discussed in (Manna & Pnueli, 1995); also these methods can be applied, once an executable behavioral specification has been generated.…”
Section: Discussionmentioning
confidence: 99%
“…Alternative methods for temporal analysis of reactive systems are discussed in (Manna & Pnueli, 1995); also these methods can be applied, once an executable behavioral specification has been generated.…”
Section: Discussionmentioning
confidence: 99%
“…Despite early contributions by Abadi, Lamport, and Wolper [5, 3], developing contracts for Cyber-Physical Systems [236,100] 8 and Reactive Systems [146,152,142,196], where mathematical behaviors are essential, boomed more recently in the 2000's, when de Alfaro and Henzinger proposed and popularized so-called interface theories [105,103,8]. Since then, a number of models have been proposed that can be seen as instances of contract theories, either to address a specific technical aspect (e.g., function, timing, and resources), or by following different styles and approaches (Assume/Guarantee contracts or Interfaces).…”
Section: A Bird's Eye View Of Research In Contractsmentioning
confidence: 99%
“…We present a variant of the just transition system of [MP95]. A JTS is described by S = V, Θ, T , with: .…”
Section: Just Transition Systemsmentioning
confidence: 99%
“…A representative case is the verification of invariance properties using the proof rule INV of [MP95]: in order to prove that assertion r is an invariant of program P , the rule requires coming up with an auxiliary assertion ϕ that is inductive (i.e. is implied by the initial condition and is preserved under every computation step) and that strengthens (implies) r. The rule is described in Fig.…”
Section: Introductionmentioning
confidence: 99%