Timed Transition Systems

@inproceedings{Henzinger1991TimedTS,
  title={Timed Transition Systems},
  author={Thomas A. Henzinger and Zohar Manna and Amir Pnueli},
  booktitle={REX Workshop},
  year={1991}
}
We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upperbound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction… 

Temporal Proof Methodologies for Timed Transition Systems

TLDR
This work extends the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-;time properties of reactive systems to solve the problem of real-time systems that communicate through shared variables or by message passing.

Temporal Proof Methodologies for Timed Transition Systems 1;2

TLDR
This work extends the speciication language of temporal logic, the corresponding veriication framework, and the underlying computational model to deal with real-time properties of reactive systems and provides a set of proof rules for establishing bounded-invariance and bounded-response properties of timed transition systems.

Temporal Proof Methodologiesfor Timed Transition Systems 1

TLDR
This work extends the speciication language of temporal logic, the corresponding veriication framework, and the underlying computational model to deal with real-time properties of reactive systems and provides a set of proof rules for establishing bounded-invariance and bounded-response properties of timed transition systems.

Compositional Refinement for Real-Time Systems with Priorities

TLDR
This paper proposes a revised definition of the product of extended timed transition systems with static and dynamic priorities associated to individual transitions, and instantiates this framework for the case of UPPAAL networks of timed automata with static priority Committed ness, dynamic priority between channels and priority between processes.

Timed transition systems with independence and timed event structures : an adjunction

TLDR
This paper focuses on asynchronous transition systems with independence, which are popular due to their simplicity and allow for natural formalization of the fact that one model is more expressive than another in terms of behavioural relations between processes.

Unifying behavioral equivalences of timed transition systems

TLDR
In the paper, various behavioral equivalences of timed transition systems are defined and studied, and based on the open maps concept, abstract characterization of the considered equivalences is given.

Semantics of Times Concurrent Systems

A truly concurrent and timeless semantics is proposed for a composition of sequential, non-deterministic processes with asynchronous communication. It is shown when this semantics differs from simple

An embedding of Timed Transition Systems in HOL

TLDR
This paper reports on some preliminary investigations into the mechanization of this theory of Timed Transition Systems using the HOL theorem prover and describes how it has been formally embedded in HOL.

Durations for Truly-Concurrent Transitions

TLDR
This article presents a fully formalized model for real-time systems of geometric inspiration, based on a model of true concurrency which can express scheduling properties, and is made into a category where morphisms are simulations.

Reasoning assertionally about real-time systems

TLDR
This work considers a real-time system defined by a set of programs that execute concurrently on one or more (hardware) processors and interact between themselves and with the environment, and model the system for two different program-to-processor allocations.
...

References

SHOWING 1-10 OF 18 REFERENCES

An interleaving model for real-time

  • T. HenzingerZ. MannaA. Pnueli
  • Computer Science
    Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'
  • 1990
TLDR
This proof system can be used to verify bounded-invariance and bounded-response properties, such as timely termination of shared-variables multiprocessing systems whose semantics is defined in terms of real-time transition systems.

Temporal proof methodologies for real-time systems

TLDR
This work extends the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-time properties of reactive systems and presents and compares two fundamentally different proof methodologies for the verification of timing requirements that are expressed in these styles.

Applications of Temporal Logic to the Specification of Real-time Systems

Traditionally, temporal logic, and in particular, its application to the specification and analysis of reactive and concurrent systems, have been considered appropriate for the qualitative

The temporal specification and verification of real-time systems

TLDR
The abstract computational model of timed transition systems is introduced as a conservative extension of traditional transition systems: qualitative fairness requirements are superseded by quantitative real-time constraints on the transitions.

A really abstract concurrent model and its temporal logic

TLDR
It is shown that, by imposing the crucial condition of finite variability, the radical notion that a computational model based on the reals provides a more abstract description of concurrent and reactive systems, than the conventional conventional behavioral model of execution sequencing is advanced.

A really temporal logic

  • R. AlurT. Henzinger
  • Computer Science
    30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis and several generalizations of TPTL are shown to be highly undecidable.

The temporal logic of programs

  • A. Pnueli
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time

Real-time logics: complexity and expressiveness

  • R. AlurT. Henzinger
  • Mathematics
    [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
  • 1990
TLDR
Two elementary real-time temporal logics are identified as expressively complete fragments of the theory of timed state sequences, and these two formalisms are well-suited for the specification and verification of real- time systems.

The anchored version of the temporal framework

TLDR
There have been several technical improvements and gained insights in understanding the computational model, the logic itself, the proof system and its presentation, and connections with alternative formalisms, such as finite automata.