2015
DOI: 10.1016/j.scico.2015.05.010
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for compositional nonblocking verification using special events

Abstract: This paper proposes to improve compositional nonblocking verification of discrete event systems through the use of special events. Compositional verification involves abstraction to simplify parts of a system during verification. Normally, this abstraction is based on the set of events not used in the remainder of the system, i. e., in the part of the system not being simplified. Here, it is proposed to exploit more knowledge about the remainder of the system and check how events are being used. Always enabled… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1

Relationship

4
2

Authors

Journals

citations
Cited by 10 publications
(16 citation statements)
references
References 23 publications
(70 reference statements)
0
16
0
Order By: Relevance
“…Such models can be difficult to encode as BDDs, causing the BDD algorithm to struggle, while their relatively small state numbers in combination with early termination make them amenable for explicit methods. The models aip1efa16 abs1 and profisafe i4 abs1 are results of compositional minimisation of much larger models [6], which is a potential application of explicit algorithms.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Such models can be difficult to encode as BDDs, causing the BDD algorithm to struggle, while their relatively small state numbers in combination with early termination make them amenable for explicit methods. The models aip1efa16 abs1 and profisafe i4 abs1 are results of compositional minimisation of much larger models [6], which is a potential application of explicit algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…A lot of effort has been put into the development of algorithms for the automatic verification of this crucial property. Systems of considerable size can be verified using symbolic model checking [2] or compositional verification [3]- [6].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Nbl." refers to compositional nonblocking verification with special events (Pilbrow and Malik, 2015), which is an improved version of the earlier algorithm (Flordal and Malik, 2009). "Mod.…”
Section: Performancementioning
confidence: 99%
“…For a more theoretical description of the modelling framework with extended finitestate machines, the reader may refer to Sköldstam et al (2007) and Mohajerani et al (2016). For more detailed presentations of algorithms, as well as further benchmarks, see for exampleÅkesson et al (2002), Mohajerani et al (2014), and Pilbrow and Malik (2015).…”
Section: Introductionmentioning
confidence: 99%