Results 11 to 20 of about 26,068 (292)
Decidability Results for the Boundedness Problem [PDF]
Logical Methods in Computer Science, 2014 We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees.
Achim Blumensath +2 more
doaj +3 more sources
Trees over Infinite Structures and Path Logics with Synchronization [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures.
Alex Spelten +2 more
doaj +5 more sources
Who Decides Who Decides? [PDF]
The Hastings Center Report, 1977 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/90544/1/3561853 ...
openaire +3 more sources
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
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 +9 more sources
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
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
Da metamatemática para a ciência cognitiva From metamathematics to Cognitive Science
Trans/Form/Ação, 1999 Neste artigo, propõe-se uma configuração possível para a transição histórico-filosófica de temas investigados no domínio da metamatemática para o domínio da Ciência Cognitiva funcionalista neurocomputacional. A descrição de tal transição é feita por meio
Henrique de Morais Ribeiro
doaj +1 more source