The Existence of ω-Chains for Transitive Mixed Linear Relations
and Its Applications
release_5ibptlxpone75d2xs7bpbhebve
by
Zhe Dang, Oscar Ibarra
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.
Know of a fulltext copy of on the public web? Submit a URL and we will archive it
cs/0110063v1
access all versions, variants, and formats of this works (eg, pre-prints)