O-Minimal Hybrid Reachability Games

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-6(1:1)2010
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Related search

Additional Winning Strategies in Reachability Games*†

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

Regular Strategies in Pushdown Reachability Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Real-Time Control With Parametric Timed Reachability Games

IFAC Proceedings Volumes
2012English

Synthesis of Railway-Signaling Plans Using Reachability Games

2016English

Reachability Analysis of Hybrid Systems via Predicate Abstraction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Probabilistic Reachability Analysis for Large Scale Stochastic Hybrid Systems

2007English

Algorithmic Analysis of Polygonal Hybrid Systems, Part I: Reachability

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

Avoiding Geometric Intersection Operations in Reachability Analysis of Hybrid Systems

2012English

ProbReach: A Tool for Guaranteed Reachability Analysis of Stochastic Hybrid Systems

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy