Abstract Interval Markov Chains (IMCs) are the base of a classic probabilistic specification
theory introduced by Larsen and Jonsson in 1991. They are also a popular abstraction for …

Abstract Interval Markov Chains (IMCs) are the base of a classic probabilistic specification
theory by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic …

We propose a symbolic method to synthesise optimal values of timing parameters for
probabilistic timed automata, in the sense that the probability of reaching some set of states …

Patterns help transporting knowledge and provide common names for solutions. Architects
need a lot of experience to create long-lasting system architectures and should benefit from …

Probabilistic timed automata can be used to model systems in which probabilistic and timing
behaviour coexist. Verification of probabilistic timed automata models is generally performed …

This thesis proposes a novel approach for the synthesis of delays for timed systems, in
particular in the framework oftimed automata, a model for verifying real-time systems. Our …

This dissertation considers three important aspects of model checking Markov models:
diagnosis—generating counterexamples, synthesis—providing valid parameter values and …

Probabilistic timed automata can be used to model systems in which probabilistic and timing
behavior coexist. Verification of probabilistic timed automata models is generally performed …

Petri box calculus (PBC) is a well-known algebra of parallel processes with a Petri net
semantics. Discrete time stochastic and deterministic PBC (dtsdPBC) extends PBC with …

We propose dtsdPBC, an extension with deterministically timed multiactions of discrete time
stochastic and immediate Petri box calculus (dtsiPBC), previously presented by IV Tarasyuk …