Decidable verification for reducible timed automata specified in a first order logic with time
From MaRDI portal
Publication:1606131
DOI10.1016/S0304-3975(01)00186-4zbMath1026.68079OpenAlexW1975997547MaRDI QIDQ1606131
Danièle Beauquier, Anatol Slissenko
Publication date: 31 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00186-4
Related Items
Periodicity based decidable classes in a first order timed logic, Decidable Fragments of Many-Sorted Logic, Decidable properties for monadic abstract state machines, A first order logic for specification of timed algorithms: Basic properties and a decidable class, Decidable fragments of many-sorted logic
Cites Work
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Complexity of deciding Tarski algebra
- A theory of timed automata
- The benefits of relaxing punctuality
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item