Results 31 to 40 of about 10,140 (309)
On the decidability of connectedness constraints in 2D and 3D Euclidean spaces [PDF]
, 2011 We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies
Yavor Nenov +11 more
core +1 more source
Trace Equivalence Decision: Negative Tests and Non-determinism [PDF]
, 2011 We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability.
Hubert Comon-Lundh +5 more
core +1 more source
Towards a Notion of Distributed Time for Petri Nets
, 2001 We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we
Srba, J., Nielsen, M., Sassone, V.
core +2 more sources
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems [PDF]
, 2009 By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a large family ...
Leonid Libkin +3 more
core +1 more source
Observing the Observer (II): Deciding When to Decide [PDF]
PLoS ONE, 2010 In a companion paper [1], we have presented a generic approach for inferring how subjects make optimal decisions under uncertainty. From a Bayesian decision theoretic perspective, uncertain representations correspond to “posterior” beliefs, which result from integrating (sensory) information with subjective “prior” beliefs.
Daunizeau, J +5 more
openaire +7 more sources
Recursive Concurrent Stochastic Games [PDF]
, 2006 . We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games [14, 15] to a concurrent setting where the two players choose moves simultaneously and independently at each state.
Mihalis Yannakakis +3 more
core +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
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
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source
Deciding equivalence-based properties using constraint solving [PDF]
, 2013 Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy or authentication.
Véronique Cortier +5 more
core +1 more source