Compositional detection of Zeno behavior in Timed Automata with Deadlines

Gomez, R.S. (2009) Compositional detection of Zeno behavior in Timed Automata with Deadlines. Technical report. UKC (Full text available)

PDF
Download (221kB)
[img]
Preview

Abstract

We present a compositional analysis to detect Zeno behavior in Timed Automata with Deadlines. A syntactic analysis is defined, based on Tripakis' strong non-Zenoness property, which identifies all elementary cycles where Zeno behavior may occur. This analysis is complemented by TCTL reachability properties, which characterize the occurrence Zeno behavior in potentially unsafe cycles.

Item Type: Monograph (Technical report)
Uncontrolled keywords: Zeno, strong non-Zenoness, Timed Automata with Deadlines, reachability analysis
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 29 Mar 2010 12:16
Last Modified: 20 Apr 2012 11:41
Resource URI: http://kar.kent.ac.uk/id/eprint/24121 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year