summaryrefslogtreecommitdiff
AgeCommit message (Collapse)AuthorFilesLines
2018-04-19LalalaCamil Staps6-23/+35
2018-04-19Merge branch 'camil'Camil Staps1-14/+15
2018-04-19Remove <<<<<<HEADErin van der Veen1-1/+0
2018-04-19Merge branch 'master' of gitlab.science.ru.nl:eveen/Model-CheckingErin van der Veen7-73/+134
2018-04-19Safra's determinization algorithmErin van der Veen3-22/+45
2018-04-18Example: protocol dependenciesCamil Staps4-6/+48
2018-04-18Bars everywhereCamil Staps2-4/+8
2018-04-18(for me) more intuitive intuitive semanticsCamil Staps1-12/+15
2018-04-18Check syntactic elimination rulesCamil Staps1-22/+33
2018-04-18Minor enhancementsCamil Staps5-25/+27
2018-04-18Copy-edited first part of semantic algorithmCamil Staps1-14/+15
2018-04-18Finish(?) SSH exampleCamil Staps2-10/+8
2018-04-18Merge branch 'master' of gitlab.science.ru.nl:eveen/Model-CheckingErin van der Veen1-9/+102
2018-04-18Semi-Deterministic Büchi AutomataErin van der Veen1-0/+24
2018-04-18finish conversion exampleCamil Staps1-9/+102
2018-04-18Start with editing of the syntactic algorithm for PLTL -> LTLCamil Staps3-54/+120
2018-04-17Correct upper bound for bad prefixesCamil Staps2-23/+31
2018-04-17Upper bound for minimal bad preficesCamil Staps3-5/+97
2018-04-17Muller AutomataErin van der Veen2-0/+27
2018-04-17PLTL to Büchi automatonErin van der Veen1-0/+56
2018-04-17Start with minimal bad prefixesCamil Staps8-7/+32
2018-04-17Semantics over paths and statesCamil Staps1-16/+2
2018-04-17Deriving the formal semantics of derived operatorsCamil Staps4-15/+39
2018-04-17Add definitions of wff, wff0, wff+, wff- (and an exercise about them)Camil Staps3-1/+62
2018-04-16Start of semantic algorithmErin van der Veen2-2/+26
2018-04-16Finish Syntactic AlgorithmErin van der Veen1-2/+6
2018-04-15Elimination RulesErin van der Veen1-11/+50
2018-04-15First two separation rulesErin van der Veen2-1/+30
2018-04-15Fix rewrite rulesErin van der Veen1-6/+6
2018-04-15Merge branch 'master' of gitlab.science.ru.nl:eveen/Model-CheckingErin van der Veen5-5/+25
2018-04-15Step 1 of syntactic algorithmErin van der Veen1-2/+29
2018-04-15Add result by Sistla (1985): complexity of model checking for PLTL is the ↵Camil Staps2-2/+13
same as for LTL
2018-04-15Add two summary points, this means we do not need a comparison subsection ↵Camil Staps3-3/+12
any more
2018-04-13Introduction PLTL to LTLErin van der Veen2-1/+13
2018-04-13Add an exercise about dual modalitiesCamil Staps4-5/+38
2018-04-12Organise in different filesCamil Staps12-449/+450
2018-04-12Correct section countsCamil Staps1-12/+15
2018-04-12Add an exercise based on Markey's proof; extend the grammar because we allow ↵Camil Staps2-27/+193
PLTL formulas inside LTL formulas
2018-04-12NotationsCamil Staps2-3/+35
2018-04-12Add contribution annotationsCamil Staps1-2/+31
2018-04-12Examples; definition of vDashCamil Staps2-34/+73
2018-04-12StylingCamil Staps1-34/+70
2018-04-12LTLP -> PLTL; add SSH example; simplify Tikz; changes to look more like ↵Camil Staps2-114/+164
Baier-Katoen; dual modalities
2018-04-10Align intuitive symanticsErin van der Veen1-4/+6
2018-04-10Define equivalence for LTLPErin van der Veen1-0/+13
2018-04-10Definitions do change, change definitionsErin van der Veen1-1/+16
2018-04-09LTL-Past -> LTLPErin van der Veen1-1/+1
2018-04-09Formal semantics of LTLPErin van der Veen1-1/+37
2018-04-09Intuitive SemanticsErin van der Veen1-2/+71
2018-04-09Extend syntaxErin van der Veen1-10/+14
generated by cgit v1.2.3 (git 2.39.1) at 2025-03-15 06:41:17 +0000