Efficient finite abstraction of mixed monotone systems
From MaRDI portal
Publication:2988916
DOI10.1145/2728606.2728607zbMath1364.93238OpenAlexW2065798383MaRDI QIDQ2988916
Publication date: 19 May 2017
Published in: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2728606.2728607
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Finite abstraction of mixed monotone systems with discrete and continuous inputs ⋮ Abstraction-based synthesis for stochastic systems with omega-regular objectives ⋮ Formal controller synthesis from specifications given by discrete-time hybrid automata ⋮ Symbolic control design for monotone systems with directed specifications ⋮ Compositional abstraction refinement for control synthesis ⋮ Symbolic control for stochastic systems via finite parity games ⋮ Synthesis of event-triggered controllers for SIRS epidemic models ⋮ Augmented finite transition systems as abstractions for control synthesis ⋮ Lazy Abstraction-Based Controller Synthesis ⋮ Application of the Hirsch Generic Convergence Statement to the Set‐Point Regulation of Excitable‐Transparent‐Monotone Systems ⋮ Lazy controller synthesis for monotone transition systems and directed safety specifications ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey ⋮ Stability of traffic flow networks with a polytree topology
Cites Work
This page was built for publication: Efficient finite abstraction of mixed monotone systems