Generalised nonblocking

Malik, Robi; Leduc, Ryan J.

doi:10.1109/wodes.2008.4605969

Cited by 9 publications

(26 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Algorithm 2 is a simplified version of the implemented algorithm, which also handles generalised nonblocking [15] and the Silent Incoming rule, which does not require every incoming transition to be τ. Although the Only Silent Incoming rule has been shown as the application of Observational Equivalence followed by Silent Continuation, this algorithm is a shortcut.…”

Section: Removeunreachablestates() 26: End Ifmentioning

confidence: 99%

Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events

Pilbrow

Malik

2014

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

This report proposes to improve compositional nonblocking verification through the use of two special event types: always enabled and selfloop-only 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. Here, it is proposed to exploit more knowledge about the system and abstract events even though they are used in the remainder of the system. This can lead to more simplification than was previously possible. Abstraction rules from previous work are extended to respect the new special events and proofs show these rules still preserve nonblocking. The rules have been implemented in Waters and experimental results demonstrate that these extended simplification rules help verify several industrial-scale discrete event system models while achieving better state-space reduction than before.2

show abstract

Section: Removeunreachablestates() 26: End Ifmentioning

confidence: 99%

Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events

Pilbrow

Malik

2014

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The generalized nonblocking property introduced in (Malik and Leduc, 2008) weakens this condition by only requiring a subset of states to be coreachable. This is expressed formally using multi-colored automata, extending the traditional concept of marked states to multiple simultaneous marking conditions by labeling states with different colors or propositions.…”

Section: Generalized Nonblockingmentioning

confidence: 99%

“…This is expressed formally using multi-colored automata, extending the traditional concept of marked states to multiple simultaneous marking conditions by labeling states with different colors or propositions. The following definition is introduced in (Malik and Leduc, 2008), and is based on similar ideas in (Clarke et al, 1999;de Queiroz et al, 2004).…”

Section: Generalized Nonblockingmentioning

confidence: 99%

“…The relationship between generalized nonblocking and standard nonblocking along with some applications is discussed in (Malik and Leduc, 2008).…”

Section: Generalized Nonblockingmentioning

confidence: 99%

“…Instead of requiring that every reachable state have a path to a marked state (coreachable), they only require that a subset of states be coreachable. This inspired the authors to come up with the generalized nonblocking condition, introduced in (Malik and Leduc, 2008). They then extended the compositional verification results for standard nonblocking to this new setting in (Malik and Leduc, 2009).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Compositional Approach for Verifying Hierarchical Interface-Based Supervisory Control

Leduc

Malik

2010

IFAC Proceedings Volumes

Self Cite

View full text Add to dashboard Cite

Hierarchical Interface-based Supervisory Control (HISC) decomposes a discreteevent system into a high-level subsystem which communicates through interfaces with several low-level subsystems. The framework provides a set of local conditions that can be checked for each subsystem individually to conclude global conditions such as nonblocking and controllability. The size of HISC systems that can be verified automatically is primarily limited by the size of the largest subsystem. To overcome this limitation, this paper proposes the use of compositional verification. Most of the HISC conditions can be verified efficiently using existing methods for compositional verification, but a few are more challenging. This paper shows how these more challenging conditions can be expressed equivalently as generalized nonblocking problems, so the compositional approach for generalized nonblocking developed by the authors in (Malik and Leduc, 2009) is applicable. This makes all the HISC conditions amenable for compositional verification, considerably increasing the size of systems that can be handled using the framework.

show abstract

A survey on compositional algorithms for verification and synthesis in supervisory control

Malik,

Mohajerani,

Fabian

2023

Discrete Event Dyn Syst

View full text Add to dashboard Cite

This survey gives an overview of the current research on compositional algorithms for verification and synthesis of modular systems modelled as interacting finite-state machines. Compositional algorithms operate by repeatedly simplifying individual components of a large system, replacing them by smaller so-called abstractions, while preserving critical properties. In this way, the exponential growth of the state space can be limited, making it possible to analyse much bigger state spaces than possible by standard state space exploration. This paper gives an introduction to the principles underlying compositional methods, followed by a survey of algorithmic solutions from the recent literature that use compositional methods to analyse systems automatically. The focus is on applications in supervisory control of discrete event systems, particularly on methods that verify critical properties or synthesise controllable and nonblocking supervisors.

show abstract

Generalised nonblocking

Cited by 9 publications

References 24 publications

Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events

Compositional Nonblocking Verification with Always Enabled Events and Selfloop-Only Events

A Compositional Approach for Verifying Hierarchical Interface-Based Supervisory Control

A survey on compositional algorithms for verification and synthesis in supervisory control

Contact Info

Product

Resources

About