AbstractWe introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics—this means that traces, not firing sequences, are given a probability. This model builds upon our previous work on probabilistic event structures. We use the notion of a branching cell for event structures, and show that the latter provides an adequate conception of local state for nets. We prove a Law of Large Numbers (LLN) for Markov nets, which constitutes the main contribution of the paper. This LLN allows for the characterization, in a quantitative way, of the asymptotic behavior of Markov nets
International audienceFor distributed systems, i.e., large complex networked systems, there is a dra...
For distributed systems, i.e. large networked complex systems, there is a drastic difference between...
In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of produc...
International audienceWe introduce the model of Markov nets, a probabilistic extension of safe Petri...
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-c...
AbstractWe introduce the model of Markov nets, a probabilistic extension of safe Petri nets under th...
International audienceWe study the concept of choice for true concurrency models such as prime event...
International audienceWe study probabilistic safe Petri nets, a probabilistic exten- sion of safe Pe...
Président du jury : J.-P. Banâtre ; Rapporteurs : G. Winskel, J. Mairesse ;Examinateurs : A. Benveni...
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and proces...
International audienceThis paper is devoted to probabilistic models for concurrent systems under the...
International audienceWe introduce a new model for the design of concurrent sto-chastic real-time sy...
AbstractThis paper is devoted to probabilistic models for concurrent systems under their true-concur...
International audienceFor distributed systems, i.e., large complex networked systems, there is a dra...
For distributed systems, i.e. large networked complex systems, there is a drastic difference between...
In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of produc...
International audienceWe introduce the model of Markov nets, a probabilistic extension of safe Petri...
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-c...
AbstractWe introduce the model of Markov nets, a probabilistic extension of safe Petri nets under th...
International audienceWe study the concept of choice for true concurrency models such as prime event...
International audienceWe study probabilistic safe Petri nets, a probabilistic exten- sion of safe Pe...
Président du jury : J.-P. Banâtre ; Rapporteurs : G. Winskel, J. Mairesse ;Examinateurs : A. Benveni...
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and proces...
International audienceThis paper is devoted to probabilistic models for concurrent systems under the...
International audienceWe introduce a new model for the design of concurrent sto-chastic real-time sy...
AbstractThis paper is devoted to probabilistic models for concurrent systems under their true-concur...
International audienceFor distributed systems, i.e., large complex networked systems, there is a dra...
For distributed systems, i.e. large networked complex systems, there is a drastic difference between...
In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of produc...