A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
From MaRDI portal
Publication:5958118
DOI10.1016/S0304-3975(00)00188-2zbMath0983.68078MaRDI QIDQ5958118
Bhaskar Das Gupta, Eduardo D. Sontag
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
hybrid systems; polynomial-time algorithms; piecewise-linear systems; semiring congruences; state-space equivalence
68Q25: Analysis of algorithms and problem complexity
Related Items
Algebraic switching time identification for a class of linear hybrid systems, Reduction relations for monoid semirings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Hybrid systems
- Real addition and the polynomial hierarchy
- Remarks on piecewise-linear algebra
- A theory of timed automata
- Decidable hybrid systems
- O-minimal hybrid systems.
- Rational sets in commutative monoids
- Nonlinear regulation: The piecewise linear approach
- Hybrid automata with finite bisimulations
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Bounded Algol-Like Languages