Time-deterministic hybrid transition systems
From MaRDI portal
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Programming involving graphs or networks (90C35) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Recommendations
Cited in
(10)- From ATP to timed graphs and hybrid systems
- Hybrid systems on time scales
- Languages and models for hybrid automata: a coalgebraic perspective
- Dealing with zero-time transitions in axiom systems.
- Hybrid automata as coalgebras
- Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
- On the composition of hybrid systems
- Robust undecidability of timed and hybrid systems
- scientific article; zbMATH DE number 5198977 (Why is no real title available?)
- Analysis of three hybrid systems in timed CRL
This page was built for publication: Time-deterministic hybrid transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246822)