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

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'e0bd1c22cb'

${ noResults }

prism-accumulation/prism-examples/pta/repudiation

History

Joachim Klein e0bd1c22cb Cleanup DA-based simple path formula with bounds handling The routines in LTL2RabinLibrary for generating DA for simple path formulas with time bounds have been adapted to deal with negated labels. This makes the special preprocessing for such formulas unnecessary and we remove it. git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@11199 bbc10eb1-c90d-0410-af57-cb519fbb1720		11 years ago
..
honest	Cleanup DA-based simple path formula with bounds handling	11 years ago
malicious	Small tidies in PTA examples.	16 years ago