FROM ATP TO TIMED GRAPHS AND HYBRID SYSTEMS

被引：0

作者：

NICOLLIN, X ^{[1
]}

SIFAKIS, J ^{[1
]}

YOVINE, S ^{[1
]}

机构：

[1] LAB GENIE INFORMAT, F-38041 GRENOBLE, FRANCE

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 600卷

关键词：

REAL-TIME; SPECIFICATION OF TIMED SYSTEMS; PROCESS ALGEBRA; TIMED GRAPHS; HYBRID SYSTEMS;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The paper presents results of ongoing work aiming at the unification of some behavioural description formalisms for timed systems. We propose for 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 generalisation 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 labelled by actions or durations.

引用

页码：549 / 572

页数：24