From ATP to timed graphs and hybrid systems

DOI10.1007/BF01178579zbMath0790.68067OpenAlexW2011694130MaRDI QIDQ1323313

Joseph Sifakis, Sergio Yovine, Xavier Nicollin

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

hybrid systemsoperational semanticsprocess algebrareal-timetimed graphsalgebra of timed processesinfinitely branching transition systemsspecification of timed systems

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)

Related Items (18)

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

Uses Software

• Esterel

Cites Work

• The algebra of timed processes, ATP: Theory and application
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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