From ATP to timed graphs and hybrid systems
type: Item
instance of: scholarly article
title: From ATP to timed graphs and hybrid systems
zbMATH Open document ID: 0790.68067
DOI: 10.1007/BF01178579
author: Xavier Nicollin
author: Joseph Sifakis
author: Sergio Yovine
published in: Acta Informatica
publication date: 1994-07-04T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 567285
zbMATH Keywords: real-time
zbMATH Keywords: specification of timed systems
zbMATH Keywords: process algebra
zbMATH Keywords: operational semantics
zbMATH Keywords: algebra of timed processes
zbMATH Keywords: hybrid systems
zbMATH Keywords: timed graphs
zbMATH Keywords: infinitely branching transition systems
describes a project that uses: Esterel
MaRDI profile type: Publication
cites work: Q4036557
cites work: Q5186720
cites work: Q3028334
cites work: Q3992568
cites work: The algebra of timed processes, ATP: Theory and application
cites work: Q4036565
full work available at URL: https://doi.org/10.1007/bf01178579
OpenAlex ID: W2011694130
description: scientific article; zbMATH DE number 567285