Verification of Detectability Using Petri Nets and Detector
Detectability describes the property of a system to uniquely determine, after a finite number of observations, the current and subsequent states. In this paper, to reduce the complexity of checking the detectability properties in the framework of bounded labeled Petri nets, we use a new tool, which is called detector, to verifying the strong detectability and periodically strong detectability. First, an approach, which is based on the reachable graph and its detector, is proposed. Then, we develop a novel approach which is based on the analysis of the detector of the basis reachability graph. Without computing the whole reachability space, and without building the observer, the proposed approaches are more efficient.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Simulating Petri nets with Boolean Matrix Logic Programming
Recent attention to relational knowledge bases has sparked a demand for understanding how relations change between entities. Petri nets can represent knowledge structure and dynamically simulate interactions between enti…
Verification of Nonblockingness in Bounded Petri Nets With Minimax Basis Reachability Graphs
This paper proposes a semi-structural approach to verify the nonblockingness of a Petri net. We construct a structure, called minimax basis reachability graph (minimax-BRG): it provides an abstract description of the rea…
BlockingPetri Nets with Parameterised Data: Modelling and Verification (Extended Version)
During the last decade, various approaches have been put forward to integrate business processes with different types of data. Each of such approaches reflects specific demands in the whole process-data integration spect…
Data IntegrationOrbital Petri Nets: A Novel Petri Net Approach
Petri Nets is very interesting tool for studying and simulating different behaviors of information systems. It can be used in different applications based on the appropriate class of Petri Nets whereas it is classical, c…
PSpan:Mining Frequent Subnets of Petri Nets
This paper proposes for the first time an algorithm PSpan for mining frequent complete subnets from a set of Petri nets. We introduced the concept of complete subnets and the net graph representation. PSpan transforms Pe…
Graph Mining