Skip to main content

Compositional detection of Zeno behavior in Timed Automata with Deadlines

Gomez, Rodolfo (2009) Compositional detection of Zeno behavior in Timed Automata with Deadlines. Technical report. UKC (KAR id:24121)

PDF
Language: English
Download (283kB) Preview
[thumbnail of CompGomez.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 29 Mar 2010 12:16 UTC
Last Modified: 16 Feb 2021 12:34 UTC
Resource URI: https://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