Akehurst, David H. and Bowman, Howard and Bryans, Jeremy W. and Derrick, John
A Manual for a ModelChecker for Stochastic Automata.
(Full text available)
This technical report describes a modelchecker for Stochastic Automata, which was built based on the theory described in [BBD00]. The tool is available from: http://www.cs.ukc.ac.uk/people/staff/dha/index.html It accepts a stochastic automaton, a 'timed probabilistic until' formula pattern and a time step parameter. Note that we do not yet allow adversaries, a clock which guards two or more transitions is considered a (run-time) error. Also, we have not yet implemented the full range of the temporal logic in [BBD00]; only the 'timed probabilistic until' queries are allowed, and propositions must be atomic. The algorithm will return one of three results: true, false or undecided. If it returns true, then the automaton models the formula. If it returns false, then the automaton does not model the formula. If it returns undecided, then the algorithm was unable to determine whether the automaton models the formula.
- Depositors only (login required):