EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||||||
|
Timmer, M. and Stoelinga, M.I.A. and van de Pol, J.C.
(2011)
Confluence Reduction for Probabilistic Systems.
In: Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2011, 26 Mar - 3 Apr 2011, Saarbrücken, Germany.
pp. 311-325.
Lecture Notes in Computer Science 6605.
Springer Verlag.
ISBN 978-3-642-19834-2
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-642-19835-9_29 ![]() AbstractThis paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic process algebra with data, facilitated by an earlier defined linear format.
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||||||
