100 search results - page 9 / 20 » Symbolic Bisimulations for Probabilistic Systems |
121
click to vote
CONCUR
2001
Springer
15 years 6 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
106
Voted
FORTE
2001
15 years 3 months ago
2001
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
191
click to vote
ARTS
1999
Springer
15 years 6 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
121
click to vote
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
139
click to vote
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...