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

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

2001-10-31

arxiv.org/abs/cs/0110063v2

Computer Science

Logic in Computer Science

26 pages

Scientific paper

We show that it is decidable whether a transitive mixed linear relation has an $\omega$-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.

Affiliated with

Also associated with

No associations

Rating

The Existence of $ω$-Chains for Transitive Mixed Linear Relations and Its Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Existence of $ω$-Chains for Transitive Mixed Linear Relations and Its Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Existence of $ω$-Chains for Transitive Mixed Linear Relations and Its Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104643