International audienceWe discuss conceptional and foundational aspects of Markov automata [22]. We place this model in the context of continuous- and discrete-time Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give a detailled account of the concept of relations on distributions, and discuss how this can generalise known notions of weak simulation and bisimulation, such as to fuse sequences of internal transitions
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-c...
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelle...
International audienceWe study probabilistic safe Petri nets, a probabilistic exten- sion of safe Pe...
International audienceWe discuss conceptional and foundational aspects of Markov automata [22]. We p...
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and proces...
A substantial amount of today's engineering problems revolve around systems that are concurrent and ...
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. The...
Abstract. We present some new perspectives on an old problem: com-positionality of trace-style seman...
In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of produ...
AbstractThis paper presents the theoretical underpinning of a model for symbolically representing pr...
International audienceWe introduce the model of Markov nets, a probabilistic extension of safe Petri...
International audienceWe study the concept of choice for true concurrency models such as prime event...
34 pagesInternational audienceWe propose Markov two-components processes (M2CP) as a probabilistic m...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...
Abstract. We present a translation from stochastic automata [10, 8] into timed automata with deadlin...
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-c...
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelle...
International audienceWe study probabilistic safe Petri nets, a probabilistic exten- sion of safe Pe...
International audienceWe discuss conceptional and foundational aspects of Markov automata [22]. We p...
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and proces...
A substantial amount of today's engineering problems revolve around systems that are concurrent and ...
Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. The...
Abstract. We present some new perspectives on an old problem: com-positionality of trace-style seman...
In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of produ...
AbstractThis paper presents the theoretical underpinning of a model for symbolically representing pr...
International audienceWe introduce the model of Markov nets, a probabilistic extension of safe Petri...
International audienceWe study the concept of choice for true concurrency models such as prime event...
34 pagesInternational audienceWe propose Markov two-components processes (M2CP) as a probabilistic m...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...
Abstract. We present a translation from stochastic automata [10, 8] into timed automata with deadlin...
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-c...
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelle...
International audienceWe study probabilistic safe Petri nets, a probabilistic exten- sion of safe Pe...