Browse by author
Lookup NU author(s): Dr Jeremy Bryans
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Modern distributed systems include a class of applications in which non-functional requirements are important. In particular, these applications include multimedia facilities where real time constraints are crucial to their correct functioning. In order to specify such systems it is necessary to describe that events occur at times given by probability distributions; stochastic automata have emerged as a useful technique by which such systems can be specified and verified.However, stochastic descriptions are very general, in particular they allow the use of general probability distribution functions, and therefore their verification can be complex. In the last few years, model checking has emerged as a useful verification tool for large systems. In this article we describe two model checking algorithms for stochastic automata. These algorithms consider how properties written in a simple probabilistic real-time logic can be checked against a given stochastic automaton.
Author(s): Bryans J, Bowman H, Derrick J
Publication type: Article
Publication status: Published
Journal: ACM Transactions on Computational Logic
Year: 2003
Volume: 4
Issue: 4
Pages: 452-492
ISSN (print): 1529-3785
ISSN (electronic): 1557-945X
Publisher: ACM
URL: http://dx.doi.org/10.1145/937555.937558
DOI: 10.1145/937555.937558
Altmetrics provided by Altmetric
