Spacecraft early design validation using formal methods
The size and complexity of software in spacecraft is increasing exponentially, and this trend
complicates its validation within the context of the overall spacecraft system. Current …
complicates its validation within the context of the overall spacecraft system. Current …
A semantics for every GSPN
C Eisentraut, H Hermanns, JP Katoen… - … on Applications and …, 2013 - Springer
Abstract Generalised Stochastic Petri Nets (GSPN s) are a popular modelling formalism for
performance and dependability analysis. Their semantics is traditionally associated to …
performance and dependability analysis. Their semantics is traditionally associated to …
DFTCalc: A Tool for Efficient Fault Tree Analysis
Effective risk management is a key to ensure that our nuclear power plants, medical
equipment, and power grids are dependable; and it is often required by law. Fault Tree …
equipment, and power grids are dependable; and it is often required by law. Fault Tree …
Rare event simulation for dynamic fault trees
Fault trees (FT) are a popular industrial method for reliability engineering, for which Monte
Carlo simulation is an important technique to estimate common dependability metrics, such …
Carlo simulation is an important technique to estimate common dependability metrics, such …
Formal Methods for Aerospace Systems: Achievements and Challenges
The size and complexity of control software in aerospace systems is rapidly increasing, and
this development complicates its validation within the context of the overall spacecraft …
this development complicates its validation within the context of the overall spacecraft …
COMPASS 3.0
Abstract COMPASS (COrrectness, Modeling and Performance of AeroSpace Systems) is an
international research effort aiming to ensure system-level correctness, safety, dependability …
international research effort aiming to ensure system-level correctness, safety, dependability …
Modelling, reduction and analysis of Markov automata
Markov automata (MA) constitute an expressive continuous-time compositional modelling
formalism. They appear as semantic backbones for engineering frameworks including …
formalism. They appear as semantic backbones for engineering frameworks including …
Modelling and analysis of Markov reward automata
Costs and rewards are important ingredients for many types of systems, modelling critical
aspects like energy consumption, task completion, repair costs, and memory usage. This …
aspects like energy consumption, task completion, repair costs, and memory usage. This …
Analysis of timed and long-run objectives for Markov automata
D Guck, H Hatefi, H Hermanns… - Logical Methods in …, 2014 - lmcs.episciences.org
Markov automata (MAs) extend labelled transition systems with random delays and
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …
[HTML][HTML] Ptrebeca: Modeling and analysis of distributed and asynchronous systems
Distributed systems exhibit probabilistic and non-deterministic behaviors and may have time
constraints. Probabilistic Timed Rebeca (PTRebeca) is introduced as a timed and …
constraints. Probabilistic Timed Rebeca (PTRebeca) is introduced as a timed and …