Tools and Algorithms for Construction and Analysis of SystemsW (2004) Decidable and undecidable problems in schedulability analysis using timed automata - Krca虂l, Yi () Citation Context ...t. Timed automata [4] have been used to specify the arrival patterns of tasks so that schedulability ...
Following an idea presented in (Otto and SattlerKlein 1997) it is shown that these properties are undecidable even if attention is restricted to those finitely presented monoids that have word problems decidable in polynomial time. In the second part it is shown that for finitely presented mono...
Here are some examples of decision problems involving Tuxing machines. Is it decidable whether a given Turing machine has at least 481 states? takes more than 481 Steps on input e? takes more than 481 Steps on some input? takes more than 481 steps on all inputs? ever moves its head ...
In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10). Lecture Notes in Computer Science, vol. 6199, Springer, 527-538.Hugo Gimbert and Youssouf Oualhadj. Probabilistic automata on finite words: Decidable and undecidable problems. In International ...
J. Levy, Decidable and undecidable second-order unification problems, in Proceedings of the 9th Annual International Conference on Rewriting Techniques and Applications (RTA'98), Lecture Notes in Comput. Sci. 1379, Springer-Verlag, Berlin, 1998, pp. 47-60....
Compositional synthesis uses a proof rule to reduce an undecidable synthesis problem into several decidable synthesis problems. Bounded synthesis transforms the synthesis problem into a decidable search problem by introducing a bound on the size of the implementation. Lazy synthesis transforms the ...
Sattler-Klein, The property FDT is undecidable for ynitely presented monoids that have polynomial-time decidable word problems, Internat. J. Algebra Comput. 10 (2000) 285-307.F. Otto and A. Sattler-Klein. The property FDT is undecidable for finitely presented monoids that have polynomial-...
Decidable and Undecidable Problemsdoi:10.1007/978-1-4612-1844-9_40Here are some examples of decision problems involving Turing machines. Is it decidable whether a given Turing machineKozen, Dexter C.Cornell University
The core of this paper is Chagrova's Theorems about first-order definability of given modal formulas and modal definability of given elementary conditions. We consider classes of frames for which modal definability is decidable and classes of frames for which first-order definability is trivial. ...