102 search results - page 10 / 21 » Symbolic Model Checking for Probabilistic Processes |
139
Voted
QEST
2010
IEEE
15 years 15 days ago
2010
IEEE
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
158
Voted
DAC
2004
ACM
16 years 3 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
141
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
121
Voted
FOSSACS
2005
Springer
15 years 8 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
109
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...