On the public citation graph

O-Minimal Hybrid Systems

0 signed · 243 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470611012.ch4openalex-snapshot
Model Checking Timed Automata
inferred← citeshttps://doi.org/10.1002/9781118558188.ch3openalex-snapshot
Control of Timed Systems
inferred← citeshttps://doi.org/10.1002/9781119716600.ch8openalex-snapshot
Hybrid Automata in Systems Biology
inferred← citeshttps://doi.org/10.1002/acs.987openalex-snapshot
Safety verification and adaptive model predictive control of the hybrid dynamics of a fuel cell system
inferred← citeshttps://doi.org/10.1002/malq.200510024openalex-snapshot
A note on the undecidability of the reachability problem for o-minimal dynamical systems
inferred← citeshttps://doi.org/10.1002/rnc.3204openalex-snapshot
Symbolic models for time-varying time-delay systems via alternating approximate bisimulation
inferred← citeshttps://doi.org/10.1002/rnc.592openalex-snapshot
Zeno hybrid systems
inferred← citeshttps://doi.org/10.1006/jsco.2001.0472openalex-snapshot
Symbolic Reachability Computation for Families of Linear Vector Fields
inferred← citeshttps://doi.org/10.1007/11562948_18openalex-snapshot
Algorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology
inferred← citeshttps://doi.org/10.1007/11590156_21openalex-snapshot
Refining the Undecidability Frontier of Hybrid Automata
inferred← citeshttps://doi.org/10.1007/11603009_14openalex-snapshot
Reachability Problems on Extended O-Minimal Hybrid Automata
inferred← citeshttps://doi.org/10.1007/11730637_26openalex-snapshot
A Fully Automated Framework for Control of Linear Systems from LTL Specifications
inferred← citeshttps://doi.org/10.1007/11730637_27openalex-snapshot
Reachability Analysis of Multi-affine Systems
inferred← citeshttps://doi.org/10.1007/11730637_4openalex-snapshot
Behavioural Approximations for Restricted Linear Differential Hybrid Automata
inferred← citeshttps://doi.org/10.1007/11780342_28openalex-snapshot
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-36580-x_36openalex-snapshot
Model Checking LTL over Controllable Linear Systems Is Decidable
inferred← citeshttps://doi.org/10.1007/3-540-45351-2_23openalex-snapshot
Control of Piecewise-Linear Hybrid Systems on Simplices and Rectangles
inferred← citeshttps://doi.org/10.1007/3-540-45351-2_35openalex-snapshot
Robust Controller Synthesis for Hybrid Systems Using Modal Logic
inferred← citeshttps://doi.org/10.1007/3-540-45351-2_9openalex-snapshot
Reach Set Computations Using Real Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/3-540-45426-8_6openalex-snapshot
An Environment for the Integrated Modelling of Systems with Complex Continuous and Discrete Dynamics
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_20openalex-snapshot
Uniform Reachability Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_26openalex-snapshot
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_34openalex-snapshot
Decidable Controller Synthesis for Classes of Linear Systems
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_35openalex-snapshot
Towards a Geometric Theory of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_8openalex-snapshot
Compositional Termination Analysis of Symbolic Forward Analysis
inferred← citeshttps://doi.org/10.1007/3-540-48983-5_15openalex-snapshot
A New Class of Decidable Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-48983-5_4openalex-snapshot
Geometric Categories, O-Minimal Structures and Control
inferred← citeshttps://doi.org/10.1007/3-540-48983-5_5openalex-snapshot
Polyhedral Flows in Hybrid Automata
inferred← citeshttps://doi.org/10.1007/3-540-49163-5_3openalex-snapshot
On Hybrid Systems and the Modal µ-calculus
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-3-030-13050-3_4openalex-snapshot
Formal Techniques for Verification and Testing of Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-30806-3_14openalex-snapshot
Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds
inferred← citeshttps://doi.org/10.1007/978-3-030-78731-8_3openalex-snapshot
Formal Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-06773-0_6openalex-snapshot
Reachability Analysis for Cyber-Physical Systems: Are We There Yet?
inferred← citeshttps://doi.org/10.1007/978-3-031-20447-0_3openalex-snapshot
Discrete Structure of H-Systems and Background on Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_6openalex-snapshot
External Interactions on Hybrid Models of Biological Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_14openalex-snapshot
Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_30openalex-snapshot
Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_1openalex-snapshot
Verification and Control of Probabilistic Rectangular Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_17openalex-snapshot
Deciding Concurrent Planar Monotonic Linear Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-24537-9_3openalex-snapshot
Polynomial Interrupt Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_34openalex-snapshot
Decidability of the Reachability for a Family of Linear Vector Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-92612-4_4openalex-snapshot
A Modest Security Analysis of Cyber-Physical Systems: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_15openalex-snapshot
On O-Minimal Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_18openalex-snapshot
Observability of Piecewise-Affine Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_37openalex-snapshot
Bisimulation of Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_40openalex-snapshot
Nonlinear Systems: Approximating Reach Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_33openalex-snapshot
Pfaffian Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_26openalex-snapshot
Taylor Approximation for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68894-5_12openalex-snapshot
Hybrid Systems and Biology
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_12openalex-snapshot
STORMED Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_23openalex-snapshot
Satisfiability of Viability Constraints for Pfaffian Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_57openalex-snapshot
Composing Semi-algebraic O-Minimal Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_16openalex-snapshot
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_6openalex-snapshot
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_1openalex-snapshot
Algebraic Systems Biology: Theses and Hypotheses
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_5openalex-snapshot
Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_10openalex-snapshot
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-78929-1_21openalex-snapshot
Dealing with Nondeterminism in Symbolic Control
inferred← citeshttps://doi.org/10.1007/978-3-540-78929-1_29openalex-snapshot
A Decidable Class of Planar Linear Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_19openalex-snapshot
Relaxing Goodness Is Still Good
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_6openalex-snapshot
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_25openalex-snapshot
Decidable Compositions of O-Minimal Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_16openalex-snapshot
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_9openalex-snapshot
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_18openalex-snapshot
Property Driven Three-Valued Model Checking on Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_21openalex-snapshot
HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour
inferred← citeshttps://doi.org/10.1007/978-3-642-14509-4_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-14509-4_7openalex-snapshot
European Train Control System
inferred← citeshttps://doi.org/10.1007/978-3-642-19237-1_10openalex-snapshot
Reasoning about Finite-State Switched Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_22openalex-snapshot
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems
inferred← citeshttps://doi.org/10.1007/s00165-011-0189-0openalex-snapshot
HYPE: Hybrid modelling by composition of flows
inferred← citeshttps://doi.org/10.1007/s00224-007-9019-4openalex-snapshot
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
inferred← citeshttps://doi.org/10.1007/s00236-006-0036-6openalex-snapshot
Symbolic models for control systems
inferred← citeshttps://doi.org/10.1007/s10009-010-0161-yopenalex-snapshot
A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata
inferred← citeshttps://doi.org/10.1007/s10009-010-0180-8openalex-snapshot
Average-price-per-reward games on hybrid automata with strong resets
inferred← citeshttps://doi.org/10.1007/s10626-009-0082-7openalex-snapshot
Discrete Semantics for Hybrid Automata
inferred← citeshttps://doi.org/10.1007/s10626-015-0218-xopenalex-snapshot
VeriSiMPL 2: An open-source software for the verification of max-plus-linear systems
inferred← citeshttps://doi.org/10.1007/s10626-020-00315-zopenalex-snapshot
Refinements of behavioural abstractions for the supervisory control of hybrid systems
inferred← citeshttps://doi.org/10.1007/s11786-011-0098-xopenalex-snapshot
PTIME Parametric Verification of Safety Properties for Reasonable Linear Hybrid Automata
inferred← citeshttps://doi.org/10.1016/b0-12-227410-5/00668-2openalex-snapshot
Robotics, Hybrid Systems for
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.014openalex-snapshot
Weighted o-minimal hybrid systems
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2019.03.010openalex-snapshot
Control of Cyber-Physical-Systems with logic specifications: A formal methods approach
inferred← citeshttps://doi.org/10.1016/j.automatica.2003.07.003openalex-snapshot
Bisimilar linear systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.02.021openalex-snapshot
Approximately bisimilar symbolic models for nonlinear control systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2015.03.004openalex-snapshot
Symbolic models for stochastic switched systems: A discretization and a discretization-free approach
inferred← citeshttps://doi.org/10.1016/j.ejcon.2012.09.001openalex-snapshot
Theory and computation of discrete state space decompositions for hybrid systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.030openalex-snapshot
Approximated Reachability on Hybrid Automata: Falsification meets Certification
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.007openalex-snapshot
Hybrid Automata in Systems Biology: How Far Can We Go?
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.12.002openalex-snapshot
Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey
inferred← citeshttps://doi.org/10.1016/j.ic.2007.05.004openalex-snapshot
Taylor approximation for hybrid systems
inferred← citeshttps://doi.org/10.1016/j.ic.2008.09.001openalex-snapshot
Inclusion dynamics hybrid automata
inferred← citeshttps://doi.org/10.1016/j.ic.2011.11.006openalex-snapshot
Low dimensional hybrid systems – decidable, undecidable, donʼt know
inferred← citeshttps://doi.org/10.1016/j.ic.2014.01.011openalex-snapshot
ϵ-Semantics computations on biological systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104580openalex-snapshot
Polynomial interrupt timed automata: Verification and expressiveness
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104861openalex-snapshot
Decisiveness of stochastic systems and its application to hybrid models
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1752openalex-snapshot
Using progress sets on non-deterministic transition systems for multiple UAV motion planning
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.06.330openalex-snapshot
Deterministic Finite-Automata Abstractions of Time-Variant Sequential Behaviours
inferred← citeshttps://doi.org/10.1016/j.inffus.2023.01.007openalex-snapshot
Knowledge representation and reasoning using interconnected uncertain rules for describing workflows in complex systems
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.003openalex-snapshot
On the expressiveness and decidability of o-minimal hybrid systems
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.02.001openalex-snapshot
Hybrid process algebra
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.10.002openalex-snapshot
Continuity controlled hybrid automata
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.02.004openalex-snapshot
Computing combinatorial types of trajectories in Pfaffian Dynamics
inferred← citeshttps://doi.org/10.1016/j.jprocont.2019.06.009openalex-snapshot
Time-optimal symbolic control of a changeover process based on an approximately bisimilar symbolic model
inferred← citeshttps://doi.org/10.1016/j.mechatronics.2010.09.007openalex-snapshot
Hybrid formation control of the Unmanned Aerial Vehicles
inferred← citeshttps://doi.org/10.1016/j.nahs.2026.101680openalex-snapshot
Linear dynamical systems with weight functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.015openalex-snapshot
Hybrid automata, reachability, and Systems Biology
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.036openalex-snapshot
Specifications for decidable hybrid games
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.031openalex-snapshot
A game-theoretic approach to fault diagnosis and identification of hybrid systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.045openalex-snapshot
Unwinding biological systems
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00034-xopenalex-snapshot
Reachability and connectivity queries in constraint databases
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36447-9openalex-snapshot
Formal Analysis of Scientific-Computation Methods
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)56362-4openalex-snapshot
Reachability computation for linear hybrid systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)56363-6openalex-snapshot
Using dynamical invariants in the analysis of hybrid dynamical systems
inferred← citeshttps://doi.org/10.1017/cbo9780511807930.003openalex-snapshot
Survey of modeling, analysis, and control of hybrid systems
inferred← citeshttps://doi.org/10.1023/b:form.0000026092.11691.96openalex-snapshot
Polyhedral Flows in Hybrid Automata
inferred← citeshttps://doi.org/10.1051/ita/2010006openalex-snapshot
Formal language properties of hybrid systems with strong resets
inferred← citeshttps://doi.org/10.1051/ita:1999123openalex-snapshot
Topologies, Continuity and Bisimulations
inferred← citeshttps://doi.org/10.1080/0020717031000123328openalex-snapshot
Supervisory target control for hybrid systems
inferred← citeshttps://doi.org/10.1080/00207170500380839openalex-snapshot
Equivalence of switching linear systems by bisimulation
inferred← citeshttps://doi.org/10.1080/00207179.2012.686672openalex-snapshot
Symbolic models for nonlinear control systems affected by disturbances
inferred← citeshttps://doi.org/10.1080/00207720903480691openalex-snapshot
Reachability analysis of rational eigenvalue linear systems
inferred← citeshttps://doi.org/10.1098/rsif.2008.0546openalex-snapshot
Intelligently deciphering unintelligible designs: algorithmic algebraic model checking in systems biology
inferred← citeshttps://doi.org/10.1109/5.871304openalex-snapshot
Discrete abstractions of hybrid systems
inferred← citeshttps://doi.org/10.1109/5.871305openalex-snapshot
Logics for hybrid systems
inferred← citeshttps://doi.org/10.1109/9.863598openalex-snapshot
Hierarchically consistent control systems
inferred← citeshttps://doi.org/10.1109/9.981719openalex-snapshot
Impulse differential inclusions: a viability approach to hybrid systems
inferred← citeshttps://doi.org/10.1109/acc.1999.783617openalex-snapshot
Control and coordination in uninhabited combat air vehicles
inferred← citeshttps://doi.org/10.1109/acc.2007.4282712openalex-snapshot
Piecewise Affine Model of a Fuel Cell for Safety Verification
inferred← citeshttps://doi.org/10.1109/acc.2010.5530738openalex-snapshot
Symbolic models for unstable nonlinear control systems
inferred← citeshttps://doi.org/10.1109/acc.2014.6858790openalex-snapshot
Symbolic models for networks of discrete-time nonlinear control systems
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483412openalex-snapshot
Foundations for approximation based analysis of stability properties of hybrid systems
inferred← citeshttps://doi.org/10.1109/cacsd.2011.6044564openalex-snapshot
On a control-oriented notion of finite state approximation
inferred← citeshttps://doi.org/10.1109/cdc.2000.912129openalex-snapshot
Semidecidable controller synthesis for classes of linear hybrid systems
inferred← citeshttps://doi.org/10.1109/cdc.2000.912828openalex-snapshot
Toward optimal control of switched linear systems
inferred← citeshttps://doi.org/10.1109/cdc.2003.1272635openalex-snapshot
Finite bisimulations of controllable linear systems
inferred← citeshttps://doi.org/10.1109/cdc.2004.1428674openalex-snapshot
Constructing decidable hybrid systems with velocity bounds
inferred← citeshttps://doi.org/10.1109/cdc.2004.1430245openalex-snapshot
Finite automata approximations with error bounds for systems with quantized actuation and measurement: a case study
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582234openalex-snapshot
Semi-Algebraic Constant Reset Hybrid Automata - SACoRe
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738788openalex-snapshot
Symbolic models for nonlinear control systems affected by disturbances
inferred← citeshttps://doi.org/10.1109/cdc.2009.5399920openalex-snapshot
Realization theory of Nash systems
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717222openalex-snapshot
An integrated approach to the symbolic control design of nonlinear systems with infinite states specifications
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717751openalex-snapshot
Probabilistic bisimulations of switching and resetting diffusions
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161343openalex-snapshot
Finite-state simulations and bisimulations for discrete-time piecewise affine systems
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402348openalex-snapshot
On existence and construction of finite uniform bisimulations for linear systems with finite input alphabets
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799116openalex-snapshot
Bisimulations for input-output stability of hybrid systems
inferred← citeshttps://doi.org/10.1109/cit.2010.316openalex-snapshot
Predicting Events for the Simulation of Hybrid Systems
inferred← citeshttps://doi.org/10.1109/dsd.2012.87openalex-snapshot
Model Checking on Hybrid Automata
inferred← citeshttps://doi.org/10.1109/dsd.2013.143openalex-snapshot
pyHybrid Analysis: A Package for Semantics Analysis of Hybrid Systems
inferred← citeshttps://doi.org/10.1109/ecc.2015.7330740openalex-snapshot
A computational procedure for bisimulation of hybrid dynamical systems
inferred← citeshttps://doi.org/10.1109/ecc.2016.7810321openalex-snapshot
Computing reachable sets of linear vector fields revisited
inferred← citeshttps://doi.org/10.1109/iccps.2012.24openalex-snapshot
Parametrized Verification of Distributed Cyber-Physical Systems: An Aircraft Landing Protocol Case Study
inferred← citeshttps://doi.org/10.1109/iceccs.2014.32openalex-snapshot
A Refinement Calculus for Hybrid Systems
inferred← citeshttps://doi.org/10.1109/icinfa.2009.5205124openalex-snapshot
Symbolic reachability computation of a class of second-order systems
inferred← citeshttps://doi.org/10.1109/icra.2013.6631229openalex-snapshot
Patching task-level robot controllers based on a local μ-calculus formula
inferred← citeshttps://doi.org/10.1109/jproc.2002.805818openalex-snapshot
Invisible formal methods for embedded control systems
inferred← citeshttps://doi.org/10.1109/jproc.2012.2189792openalex-snapshot
Cyber–Physical Systems: A Perspective at the Centennial
inferred← citeshttps://doi.org/10.1109/lics.2006.22openalex-snapshot
Control in o-minimal Hybrid Systems
inferred← citeshttps://doi.org/10.1109/mra.2011.942115openalex-snapshot
Motion Planning with Complex Goals
inferred← citeshttps://doi.org/10.1109/rtss.2009.28openalex-snapshot
Verifying Tolerant Systems Using Polynomial Approximations
inferred← citeshttps://doi.org/10.1109/rtss.2014.21openalex-snapshot
Real-Time Reachability for Verified Simplex Design
inferred← citeshttps://doi.org/10.1109/tac.2002.1000269openalex-snapshot
Consistent abstractions of affine control systems
inferred← citeshttps://doi.org/10.1109/tac.2004.838497openalex-snapshot
Equivalence of Dynamical Systems by Bisimulation
inferred← citeshttps://doi.org/10.1109/tac.2006.876946openalex-snapshot
Symbolic Control of Linear Systems Based on Symbolic Subsystems
inferred← citeshttps://doi.org/10.1109/tac.2006.876952openalex-snapshot
Reachability and Control Synthesis for Piecewise-Affine Hybrid Systems on Simplices
inferred← citeshttps://doi.org/10.1109/tac.2006.884957openalex-snapshot
Controlling a Class of Nonlinear Systems on Rectangles
inferred← citeshttps://doi.org/10.1109/tac.2006.886494openalex-snapshot
Linear Time Logic Control of Discrete-Time Linear Systems
inferred← citeshttps://doi.org/10.1109/tac.2007.914952openalex-snapshot
A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/tac.2011.2108350openalex-snapshot
Finite Approximations of Switched Homogeneous Systems for Controller Synthesis
inferred← citeshttps://doi.org/10.1109/tac.2011.2142570openalex-snapshot
Positive Invariance of Constrained Affine Dynamics and Its Applications to Hybrid Systems and Safety Verification
inferred← citeshttps://doi.org/10.1109/tac.2011.2168994openalex-snapshot
Stability and Transient Performance of Discrete-Time Piecewise Affine Systems
inferred← citeshttps://doi.org/10.1109/tac.2011.2176409openalex-snapshot
Symbolic Models for Nonlinear Control Systems Without Stability Assumptions
inferred← citeshttps://doi.org/10.1109/tac.2011.2178319openalex-snapshot
Verification of Bounded Discrete Horizon Hybrid Automata
inferred← citeshttps://doi.org/10.1109/tac.2012.2199180openalex-snapshot
A Control-Oriented Notion of Finite State Approximation
inferred← citeshttps://doi.org/10.1109/tac.2015.2422431openalex-snapshot
Stability Preserving Simulations and Bisimulations for Hybrid Systems
inferred← citeshttps://doi.org/10.1109/tac.2017.2679901openalex-snapshot
Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets
inferred← citeshttps://doi.org/10.1109/tac.2017.2763785openalex-snapshot
Reachability Analysis for Solvable Dynamical Systems
inferred← citeshttps://doi.org/10.1109/tac.2018.2833630openalex-snapshot
Design of Symbolic Controllers for Networked Control Systems
inferred← citeshttps://doi.org/10.1109/tac.2023.3327329openalex-snapshot
Symmetry-Based Abstractions for Hybrid Automata
inferred← citeshttps://doi.org/10.1109/wodes.2008.4605960openalex-snapshot
Discreteness, hybrid automata, and biology
inferred← citeshttps://doi.org/10.1137/070698580openalex-snapshot
Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations
inferred← citeshttps://doi.org/10.1137/080716955openalex-snapshot
Semantics and Computability of the Evolution of Hybrid Systems
inferred← citeshttps://doi.org/10.1137/110847482openalex-snapshot
Realization Theory of Nash Systems
inferred← citeshttps://doi.org/10.1145/1967701.1967714openalex-snapshot
Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
inferred← citeshttps://doi.org/10.1145/1967701.1967722openalex-snapshot
A dynamic algorithm for approximate flow computations
inferred← citeshttps://doi.org/10.1145/2185632.2185662openalex-snapshot
Pre-orders for reasoning about stability
inferred← citeshttps://doi.org/10.1145/2461328.2461374openalex-snapshot
Control design for specifications on stochastic hybrid systems
inferred← citeshttps://doi.org/10.1145/2723871openalex-snapshot
Real-Time Reachability for Verified Simplex Design
inferred← citeshttps://doi.org/10.1145/2728606.2728624openalex-snapshot
What's decidable about recursive hybrid automata?
inferred← citeshttps://doi.org/10.1145/2883817.2883841openalex-snapshot
Towards Model Checking of Implantable Cardioverter Defibrillators
inferred← citeshttps://doi.org/10.1145/3302504.3311797openalex-snapshot
On the decidability of linear bounded periodic cyber-physical systems
inferred← citeshttps://doi.org/10.1145/335168.335213openalex-snapshot
Reachability and connectivity queries in constraint databases
inferred← citeshttps://doi.org/10.1145/3380825openalex-snapshot
Differential Equation Invariance Axiomatization
inferred← citeshttps://doi.org/10.1145/3603288openalex-snapshot
Formal Methods for Safe Autonomy
inferred← citeshttps://doi.org/10.1145/3603288.3603289openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3603288.3603290openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3603288.3603291openalex-snapshot
Mathematical Preliminaries
inferred← citeshttps://doi.org/10.1145/3603288.3603292openalex-snapshot
Models of Autonomous Systems
inferred← citeshttps://doi.org/10.1145/3603288.3603293openalex-snapshot
Data-driven Verification
inferred← citeshttps://doi.org/10.1145/3603288.3603294openalex-snapshot
Computing Discrepancy
showing the first 200 of 243 · page through all 243
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.