On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
From MaRDI portal
Recommendations
- Automated Technology for Verification and Analysis
- Analysis of timed systems using time-abstracting bisimulations
- scientific article; zbMATH DE number 1418466
- Time-abstracted bisimulation: Implicit specifications and decidability
- Time abstracted bisimulation: Implicit specifications and decidability
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours
- scientific article; zbMATH DE number 1339961
- On convergence-sensitive bisimulation and the embedding of CCS in timed CCS
- CONCUR 2005 – Concurrency Theory
- Revisiting local time semantics for networks of timed automata
Cites work
- Analysis of timed systems using time-abstracting bisimulations
- Bisimilar linear systems.
- Bisimulation relations for dynamical and control systems
- Bisimulation relations for dynamical, control, and hybrid systems
- Equivalence of Dynamical Systems by Bisimulation
- Equivalence of switching linear systems by bisimulation
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1100439 (Why is no real title available?)
- scientific article; zbMATH DE number 6783107 (Why is no real title available?)
- scientific article; zbMATH DE number 3250267 (Why is no real title available?)
- Hybrid dynamical systems
- Introduction to bisimulation and coinduction
- Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
- Model-checking in dense real-time
- Modeling and simulation in Scilab/Scicos with ScicosLab 4.4
- On representations of abstract systems with partial inputs and outputs
- On Simulations and Bisimulations of General Flow Systems
- On the bisimulation proof method
- Switching in systems and control
- The algorithmic analysis of hybrid systems
Cited in
(6)- Time-abstracted bisimulation: Implicit specifications and decidability
- Simple-named complex-valued nominative data -- definition and basic operations
- Kleene algebra of partial predicates
- On algebras of algorithms and specifications over uninterpreted data
- On an algorithmic algebra over simple-named complex-valued nominative data
- scientific article; zbMATH DE number 1418466 (Why is no real title available?)
This page was built for publication: On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739458)