From ATP to timed graphs and hybrid systems (Q1323313)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | From ATP to timed graphs and hybrid systems |
scientific article |
Statements
From ATP to timed graphs and hybrid systems (English)
0 references
4 July 1994
0 references
The paper presents results of ongoing work aiming at the unification of some behavioral description formalisms for timed systems. We propose for the algebra of timed processes ATP a very general semantics in terms of a time domain. It is then shown how ATP can be translated into a variant of timed graphs. This result allows the application of existing model- checking techniques to ATP. Finally, we propose a notion of hybrid systems as a generalization of timed graphs. Such systems can evolve, either by executing a discrete transition, or by performing some ``continuous'' transformation. The formalisms studied admit the same class of models: time deterministic and time continuous, possibly infinitely branching transition systems labeled by actions or durations.
0 references
real-time
0 references
specification of timed systems
0 references
process algebra
0 references
operational semantics
0 references
algebra of timed processes
0 references
hybrid systems
0 references
timed graphs
0 references
infinitely branching transition systems
0 references