s14h
/
prism-accumulation
1
0
Fork 0
Code Releases Activity
Browse Source

Updated PTA notes. 

git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@2210 bbc10eb1-c90d-0410-af57-cb519fbb1720
master
Dave Parker 15 years ago
parent
d435bdbc84
commit
1924677c45
1 changed files with 1 additions and 1 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Split View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 2
      prism/NOTES-PTAS.txt

2
prism/NOTES-PTAS.txt
View File

@ -13,7 +13,7 @@ There are a set of PRISM PTA examples in the directory examples/pta. See the for
* Properties
Properties are specified in PCTL, with no nested P operators, i.e. essentially we allow unbounded or time-bounded reachability properties: properties of the form Pmin=?[F...], Pmax=?[F...], Pmin=?[F<=T...] or Pmax=?[F<=T...]. See the .pctl files included with the examples for some sample properties. For digital clocks, a few less restrictions are in place, e.g. until formulae are allowed, as are arithmetic expression such as 1-Pmin=?[F...].
Properties are specified in PCTL, with no nested P operators, i.e. essentially we allow unbounded or time-bounded reachability properties: properties of the form Pmin=?[F a], Pmax=?[F a], Pmin=?[F<=T a] or Pmax=?[F<=T a], where a is a Boolean-valued expression, not including any clock variables. See the .pctl files included with the examples for some sample properties. For digital clocks, a few less restrictions are in place, e.g. until formulae are allowed, as are clock variables in expressions, as are arithmetic expressions such as 1-Pmin=?[F...].
* Running PRISM

Write Preview
Loading…
Cancel
Save