This note repairs some inaccuracies in the congruence proof for recursion previously developed for Markovian bisimulation equivalence. We provide a revised proof based on standard machinery obtained by smoothly extending Milner's technique based on bisimulation up to. The machinery we introduce for EMPA can be easily adapted in order to obtain accurate proofs for any other Markovian process algebra
International audienceWe transfer a notion of quantitative bisimilarity for labelled Markov processe...
We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, wh...
AbstractA notion of branching bisimilarity for the alternating model of probabilistic systems, compa...
This note repairs some inaccuracies in the congruence proof for recursion previously developed for M...
Integrated-time Markovian process calculi rely on actions whose durations are quantified by exponent...
AbstractThe behavioral equivalence that is typically used to relate Markovian process terms and to r...
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce th...
The Markovian behavioral equivalences defined so far treat exponentially timed internal actions like...
Formal notions of bisimulation and simulation relation play a central role for any kind of process a...
AbstractWe introduce a new notion of bisimulation, called event bisimulation on labelled Markov proc...
Abstract. The Markovian behavioral equivalences defined so far treat exponentially timed internal ac...
CPDPs (Communicating Piecewise Deterministic Markov Processes) can be used for compositional specifi...
Abstract. Markov automata describe systems in terms of events which may be nondeterministic, may occ...
A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible wi...
International audienceWe transfer a notion of quantitative bisimilarity for labelled Markov processe...
We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, wh...
AbstractA notion of branching bisimilarity for the alternating model of probabilistic systems, compa...
This note repairs some inaccuracies in the congruence proof for recursion previously developed for M...
Integrated-time Markovian process calculi rely on actions whose durations are quantified by exponent...
AbstractThe behavioral equivalence that is typically used to relate Markovian process terms and to r...
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce th...
The Markovian behavioral equivalences defined so far treat exponentially timed internal actions like...
Formal notions of bisimulation and simulation relation play a central role for any kind of process a...
AbstractWe introduce a new notion of bisimulation, called event bisimulation on labelled Markov proc...
Abstract. The Markovian behavioral equivalences defined so far treat exponentially timed internal ac...
CPDPs (Communicating Piecewise Deterministic Markov Processes) can be used for compositional specifi...
Abstract. Markov automata describe systems in terms of events which may be nondeterministic, may occ...
A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible wi...
International audienceWe transfer a notion of quantitative bisimilarity for labelled Markov processe...
We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, wh...
AbstractA notion of branching bisimilarity for the alternating model of probabilistic systems, compa...
Add to ORKG