Results 21 to 30 of about 494,097 (364)
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
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable [PDF]
, 2012 We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and ...
Klimann, Ines
core +8 more sources
Decidability of the Membership Problem for 2 × 2 integer matrices [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2016 The main result of this paper is the decidability of the membership problem for 2 × 2 nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular 2 × 2 integer matrices M1, . . .
I. Potapov, P. Semukhin
semanticscholar +1 more source
Modularity for decidability of deductive verification with applications to distributed systems
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2018 Proof automation can substantially increase productivity in formal verification of complex systems. However, unpredictablility of automated provers in handling quantified formulas presents a major hurdle to usability of these tools.
Marcelo Taube +7 more
semanticscholar +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
Knowledge to Manage the Knowledge Society: The Concept of Theoretical Incompleteness
Systems, 2016 After having outlined the essential differences between non-complex systems and complex systems we briefly recall the conceptual approaches considered by the pre-complexity General Systems Theory introduced by Von Bertalanffy in 1968 and those of the ...
Gianfranco Minati
doaj +1 more source
Reachability and liveness in parametric timed automata [PDF]
Logical Methods in Computer Science, 2022 We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable.
Étienne André +2 more
doaj +1 more source
Termination of Triangular Integer Loops is Decidable [PDF]
, 2019 We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004, only special cases have been solved.
A Tiwari +7 more
core +3 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
Ratio Mathematica, 2019 Within the conceptual framework of number theory, we consider prime numbers and the classic still unsolved problem to find a complete law of their distribution.
Gianfranco Minati
doaj +1 more source