1650 search results - page 4 / 330 » The HOM problem is decidable |
138
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
129
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
112
Voted
FUIN
2007
15 years 3 months ago
2007
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
143
Voted
TACAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
152
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...