| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Partial Order Reduction
| Title: | Partial Order Reduction |
| Author: | Julian Brunner |
| Submission date: | 2018-06-05 |
| Abstract: | This entry provides a formalization of the abstract theory of ample set partial order reduction. The formalization includes transition systems with actions, trace theory, as well as basics on finite, infinite, and lazy sequences. We also provide a basic framework for static analysis on concurrent systems with respect to the ample set condition. |
| BibTeX: |
@article{Partial_Order_Reduction-AFP,
author = {Julian Brunner},
title = {Partial Order Reduction},
journal = {Archive of Formal Proofs},
month = jun,
year = 2018,
note = {\url{http://isa-afp.org/entries/Partial_Order_Reduction.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | Coinductive, Stuttering_Equivalence, Transition_Systems_and_Automata |
| Used by: | CAVA_LTL_Modelchecker |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |