Possibilistic and Probabilistic Abstraction-Based Model Checking (0)

by M Huth
Venue:Process Algebra and Probabilistic Methods, Performance Modeling and Veri Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science
Add To MetaCart
Results 1 - 2 of 2

A domain equation for refinement of partial systems

by Michael R. A. Huth, Radha Jagadeesan, David A. Schmidt - UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENC
"... ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
Abstract not found

Partial order reduction for probabilistic systems

by Christel Baier, Marcus Größer, Frank Ciesinski - In Proc. 1st QEST , 2004
"... In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems. The techniques to combat the state-explosion problem have mainly concentrated on symbolic methods with variants of decision diagrams or abstraction methods. In this paper, we show how partial ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems. The techniques to combat the state-explosion problem have mainly concentrated on symbolic methods with variants of decision diagrams or abstraction methods. In this paper, we show how partial order reduction with a variant of Peled’s ample set method can be applied in the context of LTL model checking for probabilistic systems modelled by Markov decision processes. 1