Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 39 for “"decidability"”.
-
Decidability questions for Petri Nets.
Thesis. 1976. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
-
Decidability for Residuated Lattices and Substructural Logics
<p>We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of …
-
Decidability bounds for extensions of Presburger arithmetic
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
-
Turing Decidability and Computational Complexity of MorseHomology
… is computable in the classical sense of Turing decidability, bound the complexity of finding the Morse homology of a given simplicial complex, and provide a measure for when this is more efficient than simplicial homology.
-
Expressiveness and Decidability of Weighted Automata and Weighted Logics
… structure. In the second part, we lift four decidability results from max-plus word automata to max-plus tree automata. Max-plus word and tree automata are weighted automata over the max-plus semiring and assign real numbers to words or trees, respectively. We show that, like for max-plus …
-
Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
-
On the decidability of problems in liveness of controlled Discrete Event Systems modeled by Petri Nets
… be called a ""finite basis"" that can lead to decidability. However, we prove that several problems of our interest are still undecidable for arbitrary PN models. That is, informally, a general PN model is still too powerful for the analysis that we are interested in. Much of the thesis is …
-
Quantifier elimination and decidability of the theory of additive integer group augmented by predicates of multiplicative cyclic submonoids
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-14 without embargo terms
-
Forbidden-Patterns and Word Extensions for Concatenation Hierarchies
… problem. In this thesis we prove/reprove the decidability of some lower levels of both hierarchies. More precisely, we characterize these levels in terms of patterns in finite automata (subgraphs in the transition graph) that are not allowed. Therefore, such characterizations are called …
-
Controller synthesis for reactive systems in distributed, real-time and hybrid settings
… In real-time setting, we establish the decidability of admission controller synthesis with the preemptive EDF scheduling policy on a single processor; for both linear time temporal logic (LTL) or quantified propositional LTL (QPLTL) specifications. In hybrid setting, we show the …
-
From game comonads to dynamical systems: property-preserving maps as a logical unifying principle
… computational aspects such as complexity and decidability hinge on the syntactic properties of formal languages. This interplay frequently manifests through relations between structures, which establish their similarity in various ways and for different purposes. In this work, we focus on …
-
The Forbidden Pattern Approach to Concatenation Hierarchies
… Such a characterization immediately implies the decidability of the respective class, since the absence of a certain pattern in a given automaton can be effectively verified. Before this work, the decidability of B(0), B(1/2), B(1) and L(0), L(1/2), L(1), L(3/2) were known. Here a detailed study …
-
On Weak Number Theories
Decidability and definability are two separate but quite related topics in logic. Many undecidability results are proved by positive definability results. In Chapter 1 we reformulate Schinzel's theorem about diophantine equations with parameters to get some number theoretic results. In later …
-
Tiling with Polyominoes, Polycubes, and Rectangles
… of algebra to tiling. We discuss the algorithmic decidability of tiling the infinite plane Z x Z given a finite set of polyominoes. We will then discuss tiling with rectangles. We will then get some new, and some analogous results concerning the possible hierarchical structure for the 3-d …
-
Dependency Tracking and Dependent Types
… predicate. From normalization, it derives the decidability of type conversion. Finally, it presents a proof technique for the decidability of type conversion that combines a minimal logical predicate and syntactic results about confluence that are type-system agnostic. The proof technique is …
-
Generalizations of quasiconvexity for finitely generated groups
… [67]. Finding algorithms for the detection and decidability of various properties of groups is a fundamental theme in geometric group theory. For a word-hyperbolic group G, Kapovich [55] provided a partial algorithm which, on input a finite set S of G, halts if S generates a quasiconvex subgroup …
-
Symbolic planning for heterogeneous robots through composition of their motion description languages
… MDLe operator), and thus establish closeness and decidability properties for MDLe compositions. We introduce an instance of the sliding block puzzle as a multi-robot hybrid system. We automate the process of planning and dictate how the behaviors are sequentially synthesized into plans that drive …
-
Automata-based decision procedures for weak arithmetics
… mathematical tool for <br>understanding the decidability of different weak systems of <br>arithmetic. A prominent example is the weak monadic second-order logic <br>of one successor, WS1S for short, which is tightly connected to <br>automata over finite words. Nowadays, automata have also …
-
QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES
… Control Language (QFCs) are developed. Moreover, decidability questions related to periodicity in measure-once QFAs, measure-many QFAs, LQFAs, and QFCs are analyzed. For DPDAwtl’s - which extend traditional deterministic pushdown automata by incorporating the ability of skipping input characters - …
-
Exact geometry algorithms for robotic motion planning
… In the first case, we explore issues of decidability in task and motion planning by giving a decision procedure for prehensile task and motion planning. In the second section, we present a holonomic motion planning algorithm that can almost always identify the exact optimal solution as a …
Page 1 of 2