Sciweavers

434 search results - page 80 / 87
» Monadic Bounded Algebras
Sort
View
MICAI
2005
Springer
14 years 3 months ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
FSTTCS
2003
Springer
14 years 3 months ago
Reachability Analysis of Process Rewrite Systems
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
Ahmed Bouajjani, Tayssir Touili
CONCUR
2001
Springer
14 years 2 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ADBIS
1998
Springer
97views Database» more  ADBIS 1998»
14 years 2 months ago
Using Queries with Multi-Directional Functions for Numerical Database Applications
Object-oriented database management systems are often motivated by their support for new emerging application areas such as computer-aided design and analysis systems. The object-o...
Staffan Flodin, Kjell Orsborn, Tore Risch
CADE
1998
Springer
14 years 2 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary