Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
From MaRDI portal
Publication:6120709
DOI10.1145/3501710.3519529OpenAlexW4225396558MaRDI QIDQ6120709
Olga Tveretina, Mateus de Oliveira Oliveira
Publication date: 21 February 2024
Published in: 25th ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3501710.3519529
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- What's decidable about hybrid automata?
- Computability with low-dimensional dynamical systems
- Deciding reachability for piecewise constant derivative systems on orientable manifolds
- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond
- Computer Aided Verification
- Numerical quadrature over smooth, closed surfaces
- TRAJECTORIES ON NONORIENTABLE TWO-DIMENSIONAL MANIFOLDS
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Deciding stability and mortality of piecewise affine dynamical systems
This page was built for publication: Mortality and Edge-to-Edge Reachability are Decidable on Surfaces