: A major challenge for Service–oriented Computing is how to discover and compose (Web) services to build complex applications. We present a matchmaking system that exploits both...
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
Marco Beccuti, Giuliana Franceschinis, Serge Hadda...
The assessment of a probability distribution associated with a Bayesian network is a challenging task, even if its topology is sparse. Special probability distributions based on t...
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...