298 search results - page 10 / 60 » Abstract Models of Transfinite Reductions |
129
click to vote
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
109
click to vote
WOLLIC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
STTT
2010
14 years 8 months ago
2010
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
STTT
2010
14 years 4 months ago
2010
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
ATVA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transit...