The Existence of ω-Chains for Transitive Mixed Linear Relations and Its Applications release_5ibptlxpone75d2xs7bpbhebve

by Zhe Dang, Oscar Ibarra

Released as a article .

2001  

Abstract

We show that it is decidable whether a transitive mixed linear relation has an ω-chain. Using this result, we study a number of liveness verification problems for generalized timed automata within a unified framework. More precisely, we prove that (1) the mixed linear liveness problem for a timed automaton with dense clocks, reversal-bounded counters, and a free counter is decidable, and (2) the Presburger liveness problem for a timed automaton with discrete clocks, reversal-bounded counters, and a pushdown stack is decidable.
In text/plain format

Archived Content

There are no accessible files associated with this release. You could check other releases for this work for an accessible version.

"Dark" Preservation Only
Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type  article
Stage   submitted
Date   2001-10-31
Version   v1
Language   en ?
arXiv  cs/0110063v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 92258f3c-ee6e-49e6-8417-03ad2a4ef491
API URL: JSON