| Age | Commit message (Expand) | Author | Files | Lines |
|---|---|---|---|---|
| 2018-04-17 | Correct upper bound for bad prefixes | Camil Staps | 1 | -11/+0 |
| 2018-04-17 | Upper bound for minimal bad prefices | Camil Staps | 1 | -0/+20 |
| 2018-04-17 | Muller Automata | Erin van der Veen | 1 | -0/+11 |
| 2018-04-17 | Start with minimal bad prefixes | Camil Staps | 1 | -0/+10 |
| 2018-04-16 | Start of semantic algorithm | Erin van der Veen | 1 | -0/+17 |
| 2018-04-15 | First two separation rules | Erin van der Veen | 1 | -0/+6 |
| 2018-04-15 | Add result by Sistla (1985): complexity of model checking for PLTL is the sam... | Camil Staps | 1 | -0/+10 |
| 2018-04-12 | Add an exercise based on Markey's proof; extend the grammar because we allow ... | Camil Staps | 1 | -0/+10 |
| 2018-04-12 | Notations | Camil Staps | 1 | -0/+9 |
| 2018-04-12 | Examples; definition of vDash | Camil Staps | 1 | -4/+4 |
| 2018-04-12 | LTLP -> PLTL; add SSH example; simplify Tikz; changes to look more like Baier... | Camil Staps | 1 | -0/+7 |
| 2018-04-08 | Introduction 1 and 2 | Erin van der Veen | 1 | -0/+63 |
 |
index : NWI-IMC046-Model-Checking | |
| Files related to NWI-IMC046 Model Checking, spring 2018, Radboud University Nijmegen. |
| summaryrefslogtreecommitdiff |