You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Tree: 532b0cf3ad

main

tempestpy_adaptions

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '532b0cf3ad'

${ noResults }

tempest/test/performance/storage

History

masawei 532b0cf3ad Added function to test if a formula is a probability bounded reachability formula, i.e. conforms to the pattern P[<,<=,>,>=]p ([phi U, E] psi) where phi, psi are propositional formulas (consisting only of And, Or, Not and AP). - For that implemented function that checks if a formula is a propositional logic formula to all three logics. - Added tests for the function. - Added documentation for the function. Former-commit-id: 3fcb84b990		11 years ago
..
BitVectorTest.cpp	Added functional and performance tests for sparse matrix.	12 years ago
MaximalEndComponentDecompositionTest.cpp	Refactored the AutoParser.	12 years ago
SparseMatrixTest.cpp	Added some performance tests for matrix-vector multiplication.	12 years ago
StronglyConnectedComponentDecompositionTest.cpp	Refactored the AutoParser.	12 years ago