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: 7f15f358c1

tempestpy_adaptions

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '7f15f358c1'

${ noResults }

tempest/test

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
..
functional	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).	11 years ago
performance	Removed the visitor from LTL and refactured the formulas to use shared pointer in stead of standart pointer.	11 years ago