Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Probabilistic Logical Characterization
Information and Computation
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Ten years of performance evaluation for concurrent systems using CADP
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Model-checking and simulation for stochastic timed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Compositional reasoning for markov decision processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Quantitative timed analysis of interactive markov chains
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Efficient modelling and generation of Markov automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Broadcast abstraction in a stochastic calculus for mobile networks
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the semantics of Markov automata
Information and Computation
Scale-Freeness of SPA models with weighted immediate actions
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Scale-Freeness of SPA models with weighted immediate actions
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Concurrency meets probability: theory and practice
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Confluence reduction for markov automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Modelling, reduction and analysis of markov automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Revisiting weak simulation for substochastic markov chains
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Compositional probabilistic verification through multi-objective model checking
Information and Computation
Model checking for probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |
We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. The model is rich enough to embody the semantics of generalised stochastic Petri nets. We define strong and weak bisimulations and discuss their compositionality properties. Weak bisimulation is partly oblivious to the probabilistic branching structure, in order to reflect some natural equalities in this spectrum of models. As a result, the standard way to associate a stochastic process to a generalised stochastic Petri net can be proven sound with respect to weak bisimulation.