Abstract
One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity. The minimal automata can be seen as canonical representations of the behaviour modulo the bisimilarity considered. Together with congruence results wrt. process algebraic operators, this can be exploited to alleviate the notorious state space explosion problem. In this paper, we aim at identifying minimal automata and canonical representations for concurrent probabilistic models. We present minimality and canonicity results for probabilistic automata wrt. strong and weak bisimilarity, together with polynomial time minimization algorithms.
Original language | English |
---|---|
Pages | 16-31 |
Number of pages | 16 |
DOIs | |
Publication status | Published - Mar 2013 |
Event | 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013 - Rome, Italy Duration: 16 Mar 2013 → 24 Mar 2013 Conference number: 19 |
Conference
Conference | 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013 |
---|---|
Abbreviated title | TACAS |
Country/Territory | Italy |
City | Rome |
Period | 16/03/13 → 24/03/13 |
Keywords
- EWI-27343
- EC Grant Agreement nr.: FP7/295261
- EC Grant Agreement nr.: FP7/318490
- IR-101830
- EC Grant Agreement nr.: FP7/318003
- EC Grant Agreement nr.: FP7/2007-2013