Sciweavers

27 search results - page 4 / 6
» Modelling Discrete Behaviour in a Continuous-Time Formalism
Sort
View
VMCAI
2010
Springer
14 years 6 months ago
Advances in Probabilistic Model Checking
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
Joost-Pieter Katoen
ACTA
2007
96views more  ACTA 2007»
13 years 9 months ago
Recursive Petri nets
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...
Serge Haddad, Denis Poitrenaud
CMSB
2011
Springer
12 years 8 months ago
The singular power of the environment on stochastic nonlinear threshold Boolean automata networks
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
Jacques Demongeot, Sylvain Sené
FORMATS
2004
Springer
14 years 2 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
14 years 3 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...