13917 search results - page 32 / 2784 » Abstraction of Probabilistic Systems |
62
Voted
IWPT
2001
14 years 11 months ago
2001
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which ...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
90
Voted
WCET
2008
14 years 11 months ago
2008
We propose an approach for timing analysis of software-based embedded computer systems that builds on the established probabilistic framework of Bayesian networks. We envision an ...
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
SEW
2006
IEEE
15 years 3 months ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...