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/graph

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
..
GraphTest.cpp	Refactored the AutoParser.	12 years ago