Sciweavers

7988 search results - page 64 / 1598
» A Useful Undecidable Theory
Sort
View
AIML
2006
13 years 10 months ago
Dynamic topological logics over spaces with continuous functions
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 9 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
ENTCS
2008
97views more  ENTCS 2008»
13 years 9 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
NFM
2011
225views Formal Methods» more  NFM 2011»
13 years 3 months ago
Synthesis for PCTL in Parametric Markov Decision Processes
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
Ernst Moritz Hahn, Tingting Han, Lijun Zhang
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
No Double Counting Semantics for Conditional Independence
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...
Prakash P. Shenoy