EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

22202 Efficient Modelling and Generation of Markov Automata

Home Policy Brochure Browse Search User Area Contact Help

Timmer, M. and Katoen, J.P. and van de Pol, J.C. and Stoelinga, M.I.A. (2012) Efficient Modelling and Generation of Markov Automata. In: Proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, 3-8 Sep 2012, Newcastle upon Tyne, United Kingdom. pp. 364-379. Advanced Research in Computing and Software Science, Lecture Notes in Computer Science (ARCoSS/LNCS) 7454. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-32939-5

Full text available as:

	PDF (Author's version) 477 Kb
	PDF (Publisher's version) - Univ. of Twente only 325 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-32940-1_26

Abstract

This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the MLPPE, enabling easy state space generation and parallel composition; and (3) several syntactic reduction techniques on the MLPPE format, for generating equivalent but smaller models.

Technically, the framework relies on an encoding of MAPA into the existing prCRL language for probabilistic automata. First, we identify a class of transformations on prCRL that can be lifted to the Markovian realm using our encoding. Then, we employ this result to reuse prCRL's linearisation procedure to transform any MAPA specification to an equivalent MLPPE, and to lift three prCRL reduction techniques to MAPA. Additionally, we define two novel reduction techniques for MLPPEs. All our techniques treat data as well as Markovian and interactive behaviour in a fully symbolic manner, working on specifications instead of models and thus reducing state spaces prior to their construction. The framework has been implemented in our tool SCOOP, and a case study on polling systems and mutual exclusion protocols shows its practical applicability.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-DSN: Dependable Systems and Networks
Research Project:	SYRUP: SYmbolic RedUction of Probabilistic Models, ROCKS: RigorOus dependability analysis using model ChecKing techniques for Stochastic systems
Uncontrolled Keywords:	Markov automata, process algebra, symbolic transformations, efficient state space generation
ID Code:	22202
Status:	Published
Deposited On:	10 September 2012
Refereed:	Yes
International:	Yes
More Information:	statistics

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