2019
DOI: 10.1007/978-3-030-30446-1_27
|View full text |Cite
|
Sign up to set email alerts
|

Formal Verification of Rewriting Rules for Dynamic Fault Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…We will show that various formal methods can effectively be used to: a) give a formal semantics to fault-tree dialects using Petri nets [5,7] b) simplify fault trees prior to their expensive analysis using graph rewriting [4] c) prove such rewriting correct with theorem proving [2] d) analyse the simplified fault trees by probabilistic model checking [10], and e) treat gigantic models by an iterative "generate partial state-space and verify" paradigm that provides sound bounds [8,10].…”
Section: Verification Conquers Reliability Engineering (Abstract Of I...mentioning
confidence: 99%
“…We will show that various formal methods can effectively be used to: a) give a formal semantics to fault-tree dialects using Petri nets [5,7] b) simplify fault trees prior to their expensive analysis using graph rewriting [4] c) prove such rewriting correct with theorem proving [2] d) analyse the simplified fault trees by probabilistic model checking [10], and e) treat gigantic models by an iterative "generate partial state-space and verify" paradigm that provides sound bounds [8,10].…”
Section: Verification Conquers Reliability Engineering (Abstract Of I...mentioning
confidence: 99%