Results 21 to 30 of about 7,198 (311)
On Decidability of Hyperbolicity
Combinatorica, 2022 We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Zdenek Dvorák 0001, Luke Postle
openaire +2 more sources
Decidability of Definability [PDF]
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011 AbstractFor a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational problem: input are quantifier-free τ-formulas ϕ0, ϕ1, …, ϕn that define relations R0, R1, …, Rn over Γ. The question is whether the relation R0 is primitive positive definable from R1, …, Rn, i.e., definable by a first-order ...
Manuel Bodirsky +2 more
openaire +3 more sources
Decision Problems for Deterministic Pushdown Automata on Infinite Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak omega-DPDAs.
Christof Löding
doaj +1 more source
Decidability of intuitionistic S4 [PDF]
, 2023 We prove the decidability of intuitionistic modal logic S4, which has been open since 1994 by using proof search in labelled sequent calculus augmented with loop-creating ...
Marin, Sonia +4 more
core +1 more source
Improved Undecidability Results for Reachability Games on Recursive Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is
Shankara Narayanan Krishna +2 more
doaj +1 more source
Decidability in Order-Based Modal Logics [PDF]
, 2017 Decidability of the validity problem is established for a family of many-valued modal logics, notably Gödel modal logics, where propositional connectives are evaluated according to the order of values in a complete sublattice of the real unit ...
Rodriguez, Ricardo +7 more
core +1 more source
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties [PDF]
, 2022 Hyperproperties are properties of systems that relate different executions traces, with many applications from security to symmetry, consistency models of concurrency, etc.
Sanchez C., Peron A., Bozzelli L.
core +1 more source
Analysis of cryptographic protocols using logics of belief: an overview
Journal of Telecommunications and Information Technology, 2002 When designing a cryptographic protocol or explaining it, one often uses arguments such as ``since this message was signed by machine B, machine A can be sure it came from B`` in informal proofs justifying how the protocol works.
David Monniaux
doaj +1 more source
Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems
IEEE Open Journal of Control Systems, 2023 The essential step of abstraction-based control synthesis for nonlinear systems to satisfy a given specification is to obtain a finite-state abstraction of the original systems.
Yiming Meng, Jun Liu
doaj +1 more source
A 15-Year Retrospective on Insertion-Deletion Systems: Progress, Evolution, and Future Directions [PDF]
Computer Science Journal of MoldovaThis paper offers a comprehensive retrospective on the development and results in the field of insertion-deletion systems over the past 15 years, building upon an earlier foundational overview from 2010.
Artiom Alhazov +2 more
doaj +1 more source