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: 6277e607cd

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from '6277e607cd'

${ noResults }

prism-accumulation/prism-examples/pta/repudiation

History

Joachim Klein 6277e607cd symbolic LTLModelChecker: convert LTL product to use statesOfInterest This starts the reachability in the product from the set of states of interest (with the corresponding initial state in the deterministic automaton). Additionally, these statesOfInterest in the product become the initial states of the product model. Deprecated legacy methods for obtaining product models as before (with the initial states in the product model being those that were initial states in the original model) are provided. git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@12049 bbc10eb1-c90d-0410-af57-cb519fbb1720		9 years ago
..
honest	symbolic LTLModelChecker: convert LTL product to use statesOfInterest	9 years ago
malicious	Small tidies in PTA examples.	16 years ago