scientific article
From MaRDI portal
Publication:2842869
zbMath1270.68177MaRDI QIDQ2842869
Publication date: 16 August 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104805231
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
Periodicity based decidable classes in a first order timed logic ⋮ Superposition as a decision procedure for timed automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theory of timed automata
- Symbolic model checking for real-time systems
- Safety, liveness and fairness in temporal logic
- HyTech: A model checker for hybrid systems
- Uppaal in a nutshell
- Predicate Abstraction for Dense Real-Time Systems1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096 and by NASA Langley Research Center under contract B09060051 and Cooperative Agreement NCC-1-399 with Honeywell Minneapolis. Most of this research has been conducted while the first author was visiting SRI International, July/August 2001.
- Graph-Based Algorithms for Boolean Function Manipulation
- Deciding Linear Inequalities by Computing Loop Residues
- Verification of Timed Automata via Satisfiability Checking
- Towards Bounded Model Checking for the Universal Fragment of TCTL
- Analysis of timed systems using time-abstracting bisimulations
- Bounded model checking using satisfiability solving
- Model checking of safety properties
