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 this file (PDF/247kB)	Preview
Request a format suitable for use with assistive technology e.g. a screenreader

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:	Reports and Papers (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 Nov 2021 10:02 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/24121 (The current URI for this page, for reference purposes)

University of Kent Author Information

Gomez, Rodolfo.

Creator's ORCID:
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.