tomjanson
5d28c4cb57
naive performance test on crowds5-4 (cf Comics)
Former-commit-id: c1616d07fd [formerly e2068f5e84 ]
Former-commit-id: 158cf0a245
11 years ago
tomjanson
fbee00e448
KSP output as BitVector or list
Former-commit-id: f8a74864f7 [formerly 3b61d8d476 ]
Former-commit-id: 4fe402ae83
11 years ago
tomjanson
b89d3f289a
group targets & minimal paths
Note that this is a major, API-breaking change.
Also bunched into this commit:
- rename namespace `shortestPaths` to `ksp`
- omit unneeded namespace qualifiers
- move tests from `GraphTest` to `KSPTest` and wrote more
- path representation explanation in .md file
Former-commit-id: f395c3df40 [formerly 7fa07d1c8f ]
Former-commit-id: f50dd3ce7c
11 years ago
tomjanson
62fcf7e0a5
thoughts about loops & target groups
Former-commit-id: c9b4b3697d [formerly 8609d79a43 ]
Former-commit-id: dea158308b
11 years ago
tomjanson
d8f2eec9af
actual test for single-target non-disjoint KSP
Former-commit-id: abb27b9078 [formerly 8492e75c07 ]
Former-commit-id: c60c829826
11 years ago
tomjanson
140597fb90
interactive debug in test
Former-commit-id: 161afac16e [formerly 17962bf200 ]
Former-commit-id: 53dc4819cf
11 years ago
tomjanson
df195d85f6
REA fully implemented; needs testing
Former-commit-id: 9795a24835 [formerly fc732962dd ]
Former-commit-id: 0ae2abacd1
11 years ago
tomjanson
38d22093a3
documentation / cleanup
Former-commit-id: e7798a5669 [formerly 43dd865fbc ]
Former-commit-id: 6fb69a017c
11 years ago
tomjanson
d6c6b9b8d5
path printing
print path ammendment: off-by-one
Former-commit-id: cdeb58711b [formerly abd5a8777f ]
Former-commit-id: 506ce7fc90
11 years ago
tomjanson
519b46f171
path construction
thanks to new Dijkstra, the (1-)shortest paths construction code is
simpler
Former-commit-id: ec2ef461b8 [formerly 5757d66bc5 ]
Former-commit-id: 00f3d35a38
11 years ago
tomjanson
fd3c59e86e
Dijkstra implementation
Originally, I tried to adapt the existing (but in various ways broken)
Dijkstra implementation in `storm::utility::graph::performDijkstra`,
but that proved to be more cumbersome (mostly because of the behaviour on
initial states) than simply rolling my own -- so that's what I
eventually did.
Former-commit-id: 33b2be8067 [formerly 0d5c507568 ]
Former-commit-id: b35fc0bee3
11 years ago
tomjanson
010f0ca988
shortest paths generator skeleton
Former-commit-id: c37fdbbec8 [formerly 23dba537c7 ]
Former-commit-id: 6eb54e64ad
11 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
11 years ago
sjunges
2aec312fbd
testcase-stub for kshortest added
Former-commit-id: 215c5b7378 [formerly 5598231acb ]
Former-commit-id: 6d51229aa1
11 years ago
sjunges
fa204dc584
gspn working again
9 years ago
sjunges
df87d7fa13
cleaned cmake list (removal of python related stuff), slightly altered doc (mainly just to improve further work on that
9 years ago
sjunges
e3c9fa103a
Merge branch 'dft_to_gspn'
9 years ago
sjunges
65fbe856e4
possibility to disable reward variable creation
9 years ago
Matthias Volk
d040e2db4b
Disable Debug compiler flags for PrismParser to lessen memory consumption during compilation
9 years ago
Sebastian Junges
7c3649297a
fix spares
9 years ago
Sebastian Junges
9851100602
mttf
9 years ago
Matthias Volk
d2544b3444
Merge
9 years ago
Matthias Volk
6672009cd1
Layouting for GSPN
9 years ago
Sebastian Junges
146bd193ea
spare activation
9 years ago
Sebastian Junges
8ef9b8a576
pdeps now fully working
9 years ago
Sebastian Junges
a57c749f72
topo sort for dependencies (stupid way..)
9 years ago
Sebastian Junges
1fc2c2e82d
dft->gspn for n-ary pdeps: WIP
9 years ago
Sebastian Junges
87b6182ea3
build n-ary pdeps for transformation
9 years ago
Sebastian Junges
0d010fa6dc
dependencies as children are dummy output
9 years ago
Sebastian Junges
f78d30ab4f
default layout info including warning
9 years ago
Matthias Volk
159890844e
Layout for AND and BE
9 years ago
sjunges
d35bc5ed36
n-ary pdeps supported as a datastructure
10 years ago
sjunges
a5c7057fc3
quickfix for setting layout info only when available (review tomorrow)
10 years ago
sjunges
a42703a49a
towards support for n-ary pdeps
10 years ago
sjunges
31efb4f0c9
prep for more formulas
10 years ago
sjunges
d379baef73
fix correct capit. to compile on linux
10 years ago
Sebastian Junges
c2ea78b880
no need anymore to create files from formulas if properties are present anyway
10 years ago
Matthias Volk
a00355e84d
Merge
10 years ago
Matthias Volk
63d594fb45
Rudimentary DFT parser from Cytoscape's JSON
10 years ago
Matthias Volk
a6cf0d2e0d
Fixed typo
10 years ago
Matthias Volk
ec060a59b2
Fixed warnings
10 years ago
Sebastian Junges
44082fbc37
pand-ex support
10 years ago
Sebastian Junges
c718b1caef
dft-por exclusive added; also ensured that PORs work under SPAREs
10 years ago
Sebastian Junges
9c5444e059
better inclusive/exclusive support, including parsing
10 years ago
Sebastian Junges
fac77c0a3e
fixed seq, now correct...
10 years ago
Sebastian Junges
80d578d130
POR[inclusive] support seems to be working now
10 years ago
Sebastian Junges
99428f9a7b
priorities updated such that 0 is not used as this is often reserved, e.g. in greatspn
10 years ago
Sebastian Junges
6e5a316f1d
fix in dft::maxrank
10 years ago
Sebastian Junges
349b0404ba
restrictions are now topo-sorted correctly
10 years ago
Sebastian Junges
92584d577f
initial support for seq in dft->gspn
10 years ago