63 search results - page 8 / 13 » Complementation of Coalgebra Automata |
149
click to vote
VMCAI
2010
Springer
15 years 10 months ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
125
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
120
click to vote
FORMATS
2003
Springer
15 years 8 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
128
Voted
ACSD
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
100
click to vote
TACAS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...