Publication details
Experimental Comparison of Algorithms Checking Proviso for Partial Order Reduction
| Basic information | |
|---|---|
| Original title: | Experimental Comparison of Algorithms Checking Proviso for Partial Order Reduction |
| Author: | Pavel Moravec |
| Further information | |
|---|---|
| Citation: | MORAVEC, Pavel. Experimental Comparison of Algorithms Checking Proviso for Partial Order Reduction. In 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov, Czech Republic : FI MU Report Series, 2006. pp. 129 -136. 2006, Mikulov, Czech Republic. |
| Original language: | English |
| Field: | Informatika |
| Type: | Article in Proceedings |
| Keywords: | model checking; partial order reduction; proviso checking |
In this paper we have summed up all known algorithms checking proviso for partial order reduction in LTL model checking. All mentioned algorithms have been implemented and experimentally evaluated on a large collection of models. Experiments mostly confirmed theoretical expectations of algorithms comparison.
Related projects:
- Integrated approach to education of PhD students in the area of parallel and distributed systems
- Techniques for automatic verification and validation of software nad hardware systems
- Institute for Theoretical Computer Science
- Highly Parallel and Distributed Computing Systems
- Automated software verification
