A quadratic-time DBM-based successor algorithm for checking timed automata

Authors:
Jianhua Zhao;Xuandong Li;Guoliang Zheng
Affiliations:
State Key Laboratory of Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, P.R. China;State Key Laboratory of Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, P.R. China;State Key Laboratory of Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, P.R. China
Venue:
Information Processing Letters
Year:
2005

Citing 7
Cited 0

Timing assumptions and verification of finite-state concurrent systems

Proceedings of the international workshop on Automatic verification methods for finite state systems
A theory of timed automata

Theoretical Computer Science
Representing and modeling digital circuits

Representing and modeling digital circuits
The tool KRONOS

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Untameable Timed Automata!

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
HYTECH: The Cornell HYbrid TECHnology Tool

Hybrid Systems II
UPPAAL: Status & Developments

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.89

Visualization

Abstract

Most of the timed automaton model checking algorithms explore state spaces by enumeration of time zones. The data structure called Difference Bound Matrix (DBM) is widely adopted to represent time zones because of its efficiency and simplicity. In this paper, we first present a quadratic-time algorithm to compute the canonical form of the conjunction of a canonical DBM and a time guard or a location invariant. Based on this algorithm, we present a quadratic-time DBM-based successor algorithm for timed automaton model checking.