1,050 research outputs found
Minimum Initial Marking Estimation in Labeled Petri Nets With Unobservable Transitions
In the literature, researchers have been studying the minimum initial marking (MIM) estimation problem in the labeled Petri nets with observable transitions. This paper extends the results to labeled Petri nets with unobservable transitions (with certain special structure) and proposes algorithms for the MIM estimation (MIM-UT). In particular, we assume that the Petri net structure is given and the unobservable transitions in the net are contact-free. Based on the observation of a sequence of labels, our objective is to find the set of MIM(s) that is(are) able to produce this sequence and has(have) the smallest total number of tokens. An algorithm is developed to find the set of MIM(s) with polynomial complexity in the length of the observed label sequence. Two heuristic algorithms are also proposed to reduce the computational complexity. An illustrative example is also provided to demonstrate the proposed algorithms and compare their performance
VERIFICATION AND APPLICATION OF DETECTABILITY BASED ON PETRI NETS
In many real-world systems, due to limitations of sensors or constraints of the environment, the system dynamics is usually not perfectly known. However, the state information of the system is usually crucial for the purpose of decision making. The state of the system needs to be determined in many applications. Due to its importance, the state estimation problem has received considerable attention in the discrete event system (DES) community. Recently, the state estimation problem has been studied systematically in the framework of detectability. The detectability properties characterize the possibility to determine the current and the subsequent states of a system after the observation of a finite number of events generated by the system.
To model and analyze practical systems, powerful DES models are needed to describe the different observation behaviors of the system. Secondly, due to the state explosion problem, analysis methods that rely on exhaustively enumerating all possible states are not applicable for practical systems. It is necessary to develop more efficient and achievable verification methods for detectability. Furthermore, in this thesis, efficient detectability verification methods using Petri nets are investigated, then detectability is extended to a more general definition (C-detectability) that only requires that a given set of crucial states can be distinguished from other states. Formal definitions and efficient verification methods for C-detectability properties are proposed. Finally, C-detectability is applied to the railway signal system to verify the feasibility of this property:
1. Four types of detectability are extended from finite automata to labeled Petri nets. In particular, strong detectability, weak detectability, periodically strong detectability, and periodically weak detectability are formally defined in labeled Petri nets.
2. Based on the notion of basis reachability graph (BRG), a practically efficient approach (the BRG-observer method) to verify the four detectability properties in bounded labeled Petri nets is proposed. Using basis markings, there is no need to enumerate all the markings that are consistent with an observation. It has been shown by other researchers that the size of the BRG is usually much smaller than the size of the reachability graph (RG). Thus, the method improves the analysis efficiency and avoids the state space explosion problem.
3. Three novel approaches for the verification of the strong detectability and periodically strong detectability are proposed, which use three different structures whose construction has a polynomial complexity. Moreover, rather than computing all cycles of the structure at hand, which is NP-hard, it is shown that strong detectability can be verified looking at the strongly connected components whose computation also has a polynomial complexity. As a result, they have lower computational complexity than other methods in the literature.
4. Detectability could be too restrictive in real applications. Thus, detectability is extended to C-detectability that only requires that a given set of crucial states can be distinguished from other states. Four types of C-detectability are defined in the framework of labeled Petri nets. Moreover, efficient approaches are proposed to verify such properties in the case of bounded labeled Petri net systems based on the BRG.
5. Finally, a general modeling framework of railway systems is presented for the states estimation using labeled Petri nets. Then, C-detectability is applied to railway signal systems to verify its feasibility in the real-world system. Taking the RBC handover procedure in the Chinese train control system level 3 (CTCS-3) as an example, the RBC handover procedure is modeled using labeled Petri nets. Then based on the proposed approaches, it is shown that that the RBC handover procedure satisfies strongly C-detectability
Diagnosability Analysis of Labeled Time Petri Net Systems
In this paper, we focus on two notions of diagnosability
for labeled Time Petri net (PN) systems:
K-diagnosability implies that any fault occurrence
can be detected after at most K observations, while
Ï„-diagnosability implies that any fault occurrence can
be detected after at most Ï„ time units. A procedure to
analyze such properties isprovided.The proposedapproach
uses the Modified State Class Graph, a graph the authors
recently introduced for the marking estimation of labeled
Time PN systems,which providesan exhaustive description
of the system behavior. A preliminary diagnosabilty analysis
of the underlying logic system based on classical
approaches taken from the literature is required. Then, the
solution of some linear programming problems should
be performed to take into account the timing constraints
associated with transitions
Mining structured Petri nets for the visualization of process behavior
Visualization is essential for understanding the models obtained by process mining. Clear and efficient visual representations make the embedded information more accessible and analyzable. This work presents a novel approach for generating process models with structural properties that induce visually friendly layouts. Rather than generating a single model that captures all behaviors, a set of Petri net models is delivered, each one covering a subset of traces of the log. The models are mined by extracting slices of labelled transition systems with specific properties from the complete state space produced by the process logs. In most cases, few Petri nets are sufficient to cover a significant part of the behavior produced by the log.Peer ReviewedPostprint (author's final draft
Diagnosis on a sliding window for partially observable Petri nets
summary:In this paper, we propose an algebraic approach to investigate the diagnosis of partially observable labeled Petri nets based on state estimation on a sliding window of a predefined length . Given an observation, the resulting diagnosis state can be computed while solving integer linear programming problems with a reduced subset of basis markings. The proposed approach consists in exploiting a subset of observations at each estimation step, which provides a partial diagnosis relevant to the current observation window. This technique allows a status update with a "forgetfulness" of past observations and enables distinguishing repetitive and punctual faults. The complete diagnosis state can be defined as a function of the partial diagnosis states interpreted on the sliding window. As the analysis shows that some basis markings can present an inconsistency with a future evolution, which possibly implies unnecessary computations of basis markings, a withdrawal procedure of these irrelevant basis markings based on linear programming is proposed
Elasticity and Petri nets
Digital electronic systems typically use synchronous clocks and primarily assume fixed duration of their operations to simplify the design process. Time elastic systems can be constructed either by replacing the clock with communication handshakes (asynchronous version) or by augmenting the clock with a synchronous version of a handshake (synchronous version). Time elastic systems can tolerate static and dynamic changes in delays (asynchronous case) or latencies (synchronous case) of operations that can be used for modularity, ease of reuse and better power-delay trade-off. This paper describes methods for the modeling, performance analysis and optimization of elastic systems using Marked Graphs and their extensions capable of describing behavior with early evaluation. The paper uses synchronous elastic systems (aka latency-tolerant systems) for illustrating the use of Petri nets, however, most of the methods can be applied without changes (except changing the delay model associated with events of the system) to asynchronous elastic systems.Peer ReviewedPostprint (author's final draft
Regular Separability of Well-Structured Transition Systems
We investigate the languages recognized by well-structured transition systems (WSTS) with upward and downward compatibility. Our first result shows that, under very mild assumptions, every two disjoint WSTS languages are regular separable: There is a regular language containing one of them and being disjoint from the other. As a consequence, if a language as well as its complement are both recognized by WSTS, then they are necessarily regular. In particular, no subclass of WSTS languages beyond the regular languages is closed under complement. Our second result shows that for Petri nets, the complexity of the backwards coverability algorithm yields a bound on the size of the regular separator. We complement it by a lower bound construction
- …