Temporal Proof Methodologies for Timed Transition Systems

@article{Henzinger1994TemporalPM,
  title={Temporal Proof Methodologies for Timed Transition Systems},
  author={Thomas A. Henzinger and Zohar Manna and Amir Pnueli},
  journal={Inf. Comput.},
  year={1994},
  volume={112},
  pages={273-337}
}
We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-;time properties of reactive systems. The abstract notion of timed transition systems generalizes traditional transition systems conservatively: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upper-bound timing constraints on transitions. This framework can model real-time systems that… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 73 CITATIONS

A timing-based schema for stabilizing information exchange

  • Proceedings of International Conference on Network Protocols
  • 1995
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Specification for probabilistic timed systems with data constraints

  • 2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)
  • 2017
VIEW 1 EXCERPT
CITES METHODS

The Method of Test Oracle Generation Based on Event Temporal Logic

  • 2017 International Conference on Computer Technology, Electronics and Communication (ICCTEC)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Learning Assumptions for CompositionalVerification of Timed Systems

  • IEEE Transactions on Software Engineering
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

1993
2017

CITATION STATISTICS

  • 2 Highly Influenced Citations