From ATP to timed graphs and hybrid systems

DOI10.1007/BF01178579MaRDI QIDQ1323313zbMATH OpenOpenAlexFDO

Authors Xavier Nicollin, Joseph Sifakis, Sergio Yovine

Publication date 4 July 1994

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01178579

zbMATH Keywords

algebra of timed processeshybrid systemsinfinitely branching transition systemsoperational semanticsprocess algebrareal-timespecification of timed systemstimed graphs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• The algebra of timed processes, ATP: Theory and application
• An introduction to timed automata
• scientific article; zbMATH DE number 1301623

Cites work

• scientific article; zbMATH DE number 4016181 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 176736 (Why is no real title available?)
• scientific article; zbMATH DE number 3894457 (Why is no real title available?)
• The algebra of timed processes, ATP: Theory and application

Cited in

(21)

• Models for reactivity
• The algebra of timed processes, ATP: Theory and application
• On the computational power of dynamical systems and hybrid systems
• Time-abstracted bisimulation: Implicit specifications and decidability
• On the rational behaviors of concurrent timers
• Verification of duration systems using an approximation approach
• Action transducers and timed automata
• Decidable integration graphs.
• Trajectory encoding for systems with irregular observations
• The fixed-point theory of strictly causal functions
• Linearization of hybrid processes
• Operational semantics for timed systems. A non-standard approach to uniform modeling of timed and hybrid systems.
• Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
• On some relations between dynamical systems and transition systems
• Automatic synthesis of real time systems
• Efficient scaling-invariant checking of timed bisimulation
• Symbolic timing devices
• Weak bisimulation for probabilistic timed automata
• An overview and synthesis on timed process algebras
• The algorithmic analysis of hybrid systems
• A theory of processes with durational actions

Describes a project that uses

Uses Software

• Esterel

This page was built for publication: From ATP to timed graphs and hybrid systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323313)