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

accumulation

accumulation-v4.7

automata-finite

master

tud-infrastructure-2018-10-12

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'd96873b876'

${ noResults }

prism-accumulation/prism-examples/pta/repudiation/malicious

History

Joachim Klein d96873b876 symbolic DTMC checker: Use LTL2WDBA construction to obtain DFA for co-safe LTL reward computations The DFA needed for co-safe LTL reward computation need to have a specific structure, i.e., all states that satisfy Sigma^omega have to be already goal states. git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@12066 bbc10eb1-c90d-0410-af57-cb519fbb1720		9 years ago
..
.args	Small tidies in PTA examples.	16 years ago
.models	Small tidies in PTA examples.	16 years ago
.props	Small tidies in PTA examples.	16 years ago
auto	Put PTA files in main examples dir.	16 years ago
deadline.pctl	Small tidies in PTA examples.	16 years ago
eventually.pctl	Small tidies in PTA examples.	16 years ago
repudiation.nm	Put PTA files in main examples dir.	16 years ago