384 search results - page 57 / 77 » On the Semantics of Markov Automata |
114
click to vote
AAAI
1990
15 years 3 months ago
1990
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
103
Voted
FOIKS
2008
Springer
15 years 3 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
106
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear t...
143
Voted
ATVA
2006
Springer
15 years 5 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
115
click to vote
ISOLA
2010
Springer
15 years 10 days ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...