Tim Quatmann
d098c2d27c
graph::computeSchedulerProb1E: Only set choices if they are not defined already.
5 years ago
TimQu
1f98f6c557
Reverted 'optimization' for Prob1Max (since that didn't work out).
5 years ago
TimQu
9d0d8022f9
Revert "Slight optimization in performProb1A"
This reverts commit 2df4679fbc
.
5 years ago
TimQu
d288701e9d
Graph: Changed methods for prob1 methods in performProb1Max / performProb1Min to more efficient variants that can be used as we already know the prob0 states.
5 years ago
Tim Quatmann
2df4679fbc
Slight optimization in performProb1A
5 years ago
Tim Quatmann
0b1b0d97e2
utility/graph: fixed behavior of getReachableStates when an initial state is not in the constrained set.
6 years ago
Tim Quatmann
5869a1f5fd
Simplified StronglyConnectedComponentDecomposition.
6 years ago
TimQu
e89cbf2886
fixed cyclic check.
6 years ago
TimQu
04082fb2d6
Added a method to check whether a graph contains a cycle.
6 years ago
Sebastian Junges
43688d09ea
reward infinity scheduler extraction is now correct
7 years ago
Sebastian Junges
93ca559c83
additional sanity checks for scheduler extraction
7 years ago
Sebastian Junges
fef4b694d4
topo sort: add first states
7 years ago
TimQu
034fbf20c7
extended SubsystemBuilder, made ChoiceSelector work for MAs as well.
7 years ago
dehnert
135c38777f
game-based abstraction working with rational numbers
7 years ago
dehnert
3ad85ba0e6
fixes and improvements for game-based abstraction
7 years ago
dehnert
a13ed96966
first working version of sparse game-based abstraction refinement
7 years ago
dehnert
c2e646b887
working towards predicate synthesis from explicit (qualitative) result for game-based abstraction
7 years ago
dehnert
c6a5d5a74d
started on refining menu games based on explicit results
7 years ago
dehnert
3f6a8fed92
fixed some issues in qualitative sparse solution of game-based abstraction
7 years ago
dehnert
9665f4fa30
sparse qualitative solving of menu games
7 years ago
dehnert
edbe3b1952
more work on explicit game solving
7 years ago
TimQu
a1c10cac37
filtering reward zero states for MDPs
7 years ago
dehnert
6042588baf
fixed one of two issues raised by TQ
8 years ago
dehnert
29903bef04
more work on general abstraction refinement framework
8 years ago
dehnert
e557a8e069
started on EC elimination for hybrid engine
8 years ago
dehnert
9bda631795
symbolic MDP helper respecting solver requirements
8 years ago
dehnert
7c24607427
started on symbolic solver requirements
8 years ago
TimQu
2d2cc95774
fixed issue #12 raised by Joachim Klein
8 years ago
TimQu
2f49255db6
Improved storage::Scheduler. We can now consider arbitrary finite memory schedulers, potentially employing randomization.
8 years ago
dehnert
ea02ea0838
started overhaul of cli/api
8 years ago
TimQu
dc079b3196
moved a function to graph.h
8 years ago
TimQu
db31c1cb11
improved .dot export of models with choice labeling
8 years ago
TimQu
a887fd9224
added possibiliy to perfromProbGreater0A only for a selected set of choices
8 years ago
dehnert
952776a057
hybrid engine working for rational numbers
8 years ago
dehnert
2e8ff870ff
completed interface of (sylvan) ADDs for storing rational functions
8 years ago
TimQu
95527421bf
added missing parenthesis
8 years ago
TimQu
ad3e99f558
Fixes in step bounded DFS implementations: A state should be reexplored whenever it is reached with a shorter path. Previously, it was not possible to explore a state multiple times.
8 years ago
TimQu
59a72b4037
parametric simplifier for mdps
8 years ago
dehnert
b258f1e52d
some more warnings gone
8 years ago
dehnert
eac2735068
fixed more warnings
8 years ago
dehnert
5b09b91ae1
fixed more warnings
8 years ago
Tom Janson
f390aeadf3
rm broken Dijkstra from graph.cpp
8 years ago
Tom Janson
b71ef02692
comments and fixes (?) to graph.cpp's Dijkstra
This implementation seemed pretty wrong in multiple ways;
I attempted to fix it (a long time ago) (see diff, you'll see what I'm
talking about), then gave up.
Luckily (?) the code is unused, just sitting there, sad and broken.
8 years ago
Tom Janson
6d1608a147
Dijkstra fixed, maybe
TODO: check; improve
Things that aren't going well:
- On the example graph BRP-16-2, all nodes have distance 1. I that
possible??
- The initial states list themself as their own predecessor. That's
bad, because it's simply false (unless there is a self-loop).
Former-commit-id: 06f9a28306
[formerly e7e2385e0d
]
Former-commit-id: 3505011831
10 years ago
dehnert
bf29488219
fix for decomposition
8 years ago
dehnert
19fd72cfb6
optimized reuse of qualitative values
9 years ago
dehnert
3d20cf0afd
some fixes and more refactoring
9 years ago
dehnert
633f4293e3
added option of splitting to predicate synthesis, added equivalence checker, fixed bug that caused some commands not to be abstracted
9 years ago
Sebastian Junges
d246517757
removed src prefix in all includes
9 years ago
Sebastian Junges
e1d201c85e
c++ code compiles again after rename
9 years ago