Results 21 to 30 of about 471,067 (339)
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
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
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
Decidability of Non-interactive Simulation of Joint Distributions [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We present decidability results for a sub-class of "non-interactive" simulation problems, a well-studied class of problems in information theory. A non-interactive simulation problem is specified by two distributions P(x, y) and Q(u, v): The goal is to ...
Badih Ghazi, Pritish Kamath, M. Sudan
semanticscholar +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
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
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
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
Undecidable problems concerning densities of languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no algorithm which, given two unambiguous context free grammars on input, decides whether the ...
Jakub Kozik
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