sp
/
tempest
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
3452 Commits
2 Branches
0 Tags
187 MiB
Tree: 35a76010b7
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '35a76010b7'
${ noResults }
Commit Graph

3452 Commits (35a76010b7517480361349afbbfadb2ed4490216)
 

Author SHA1 Message Date
Mavo 35a76010b7 Redundant include
9 years ago
Mavo ee4b6c96a8 Use operator<< from carl
9 years ago
Mavo 8521abc7ac Merge from future
9 years ago
sjunges f5e8c5ba73 Merge branch 'dft-approximation' of https://sselab.de/lab9/private/git/storm into dft-approximation
9 years ago
sjunges b044b2aca4 ..
9 years ago
Mavo cd1aec7750 Heuristic using the difference between upper and lower bound
9 years ago
Mavo 6fcc97a7b4 Implemented modularisation for MTTF via parallel composition of CTMCs
9 years ago
sjunges 875feebdb8 modularisation checks for restrictors
9 years ago
Mavo 1c95722711 Do not skip states if approx = 0.0
9 years ago
Mavo 9947d9b64c Add up exploration time
9 years ago
sjunges f1e69e42cd Merge branch 'dft-approximation' of https://sselab.de/lab9/private/git/storm into dft-approximation
9 years ago
sjunges 464a497093 smt checker v1, and better error messages
9 years ago
Mavo d95bb71f75 Tried to gain more performance
9 years ago
Mavo 64699a7bad Several improvements
9 years ago
Mavo dae1a7eefe Do not use cold BEs in first step of approximation formula
9 years ago
Mavo 02c4195f31 Better upper bound for independent subtrees
9 years ago
Mavo a2c484bba4 Support for probability approximation without modularisation
9 years ago
Mavo b669a3acef Only sort bucket queue if more than 10% is unsorted
9 years ago
Mavo 6778a018ad Use heuristic probability
9 years ago
Mavo d814143c09 Merge branch 'dft-approximation' of https://sselab.de/lab9/private/git/storm into dft-approximation
9 years ago
Mavo c12bbe2904 Disable old way of computing permutations as there is a bug for >31 elements
9 years ago
Mavo aa9cc2e0e5 Merge branch 'dft-approximation' of https://sselab.de/lab9/private/git/storm into dft-approximation
9 years ago
Mavo 876b147aa8 Fixed bug with iterator
9 years ago
Mavo d9b1285644 Alternative way of computing permutations (at the moment in parallel)
9 years ago
Mavo 386d4c7f05 Use heuristic NONE to explore complete state space
9 years ago
Mavo 8e159133da Compute lower/upper bounds only when needed
9 years ago
Mavo a9f97bd210 Set heuristic to probability
9 years ago
Mavo 58f8707293 Tighter over-approximation
9 years ago
Mavo 0d9cdd6ef8 Use Heuristic None
9 years ago
Mavo 20b00e8f1d Propagate dont care to currently not failable BEs
9 years ago
Mavo 8b78ed2340 Renamed rateratio to probability
9 years ago
Mavo 945447e7e0 Use DFS as default
9 years ago
Mavo 815bbf10ab Remove map and use linear search in BucketPriorityQueue
9 years ago
Mavo ef7d4ac87b Do not sort BEs anymore
9 years ago
Mavo 8d38358c11 Use BucketPriorityQueue instead of DynamicPriorityQueue
9 years ago
dehnert cb97da887c went from deque to vector-based representation of splitter queue in bisimulation
9 years ago
Mavo d1d77ff4df Changed deque to vector in bisimulation to gain performance boost
9 years ago
Mavo 82a3964e5d Only fix queue when needed
9 years ago
Mavo a333d29d16 Hard coded heuristic to gain performance
9 years ago
Mavo a624292ece Output no states
9 years ago
Mavo ec8b5a23f2 Fixed compile issues with under Linux
9 years ago
Mavo 1bfd974795 Minor fixes
9 years ago
Mavo 4a6f53031e Choose different approximation heuristics
9 years ago
Mavo 26d0a3a7a4 Fixed smaller bugs
9 years ago
Mavo 8e1e61c4f2 Changed datastructures and made handling of pseudo states easier
9 years ago
Mavo e05c4dab0d Use custom DynamicPriorityQueue
9 years ago
Mavo faadf19228 Approximation error is relative to mean of lower and upper bound
9 years ago
Mavo ea00abc35e Fixed problems with approximation while using symred
9 years ago
Mavo a419cb0d80 Fixed computing rates for lower and upper bound
9 years ago
Mavo 6faa7f0429 Abort when getting infinity in approximation
9 years ago