Incremental Verification and Synthesis of Discrete-Event Systems Guided by Counter Examples

Brandin, B.A.; Malik, Robi; Malik, Petra

doi:10.1109/tcst.2004.824795

Cited by 55 publications

(60 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The requirement for always enabled events can be further relaxed by considering conditionally always enabled events [15], where the remaining automata of the system are examined more closely using an incremental controllability check [24]. Then an event η is considered as always enabled when simplifying an automaton G, if the environment T enables η in all states (x G , x T ) of G T where η is enabled in the state x G of G. This approach allows for more events to be considered as always enabled, but repeatedly checking such conditions of all the automata not being abstracted is time-consuming [15].…”

Section: Examplementioning

confidence: 99%

An algorithm for compositional nonblocking verification using special events

Pilbrow

Malik

2015

Science of Computer Programming

View full text Add to dashboard Cite

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 events, selfloop-only events, failing events, and blocked events are easy to detect and often help with simplification even though they are used in the remainder of the system. Abstraction rules from previous work are generalised, and experimental results demonstrate the applicability of the resulting algorithm to verify several industrial-scale discrete event system models, while achieving better state-space reduction than before.

show abstract

Section: Examplementioning

confidence: 99%

An algorithm for compositional nonblocking verification using special events

Pilbrow

Malik

2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…It is known that controllability of subsystems implies controllability of the global system (Brandin et al, 2004). This suggests that global controllability can be ensured if each subsystem is controllable on its own.…”

Section: Conf(f (H)) = ∅ This Means That F (H) Is Nonblocking Iementioning

confidence: 99%

Hierarchical Interface-Based Supervisory Control Using the Conflict Preorder

Malik

Leduc

2012

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Hierarchical Interface-Based Supervisory Control decomposes a large discrete event system into subsystems linked to each other by interfaces, facilitating the design of complex systems and the re-use of components. By ensuring that each subsystem satisfies its interface consistency conditions locally, it can be ensured that the complete system is controllable and nonblocking. The interface consistency conditions proposed in this paper are based on the conflict preorder, providing increased flexibility over previous approaches. The framework requires only a small number of interface consistency conditions, and allows for the design of multi-level hierarchies that are provably controllable and nonblocking.

show abstract

“…Hence, tasks such as persistent surveillance could not be specified. Incremental verification and synthesis for other types of systems and specifications can be found, e.g., in [18]- [20].…”

Section: Introductionmentioning

confidence: 99%

Incremental synthesis of control policies for heterogeneous multi-agent systems with linear temporal logic specifications

Wongpiromsarn

Ulusoy

Belta

et al. 2013

2013 IEEE International Conference on Robotics and Automation

View full text Add to dashboard Cite

Abstract-We consider automatic synthesis of control policies for non-independent, heterogeneous multi-agent systems with the objective of maximizing the probability of satisfying a given specification. The specification is expressed as a formula in linear temporal logic. The agents are modeled by Markov decision processes with a common set of actions. These actions, however, may or may not affect the behaviors of all the agents. To alleviate the well-known state explosion problem, an incremental approach is proposed where only a small subset of agents is incorporated in the synthesis procedure initially and more agents are successively added until the limitations on computational resources are reached. The proposed algorithm runs in an anytime fashion, where the probability of satisfying the specification increases as the algorithm progresses.

show abstract

Incremental Verification and Synthesis of Discrete-Event Systems Guided by Counter Examples

Cited by 55 publications

References 14 publications

An algorithm for compositional nonblocking verification using special events

An algorithm for compositional nonblocking verification using special events

Hierarchical Interface-Based Supervisory Control Using the Conflict Preorder

Incremental synthesis of control policies for heterogeneous multi-agent systems with linear temporal logic specifications

Contact Info

Product

Resources

About