Optimal state-space partition for control of discrete-event systems with static specifications

1998 ◽  
Vol 43 (7) ◽  
pp. 1013-1016
Author(s):  
S. Takai
Keyword(s):  
State Space ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Optimal State ◽  
Space Partition ◽  
Event Systems

scholarly journals An Experimental Comparison of Three Diagnosis Techniques for Discrete Event Systems

10.29007/vwc9 ◽  
2018 ◽  
Author(s):  
Abderraouf Boussif ◽  
Baisi Liu ◽  
Mohamed Ghazel
Keyword(s):  
Fault Diagnosis ◽  
State Space ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Experimental Comparison ◽  
Space Representation ◽  
Level Crossing ◽  
Time Consumption ◽  
State Space Representation ◽  
Event Systems

This paper deals with a benchmark-based experimental comparison of three diagnoser-based approaches for fault diagnosis of discrete event systems modeled by Petri nets: the MBRG/BRD approach, the FMG/FMSG approach and the SSD approach. The experiments are performed on a level crossing benchmark, using the respective software tools integrating the approaches. Different features are shown in terms of state-space building (exhaustive or partial), procedure for analyzing diagnosability (based on complete or on-the-fly built state-space) and state-space representation (concrete or symbolic). Based on the obtained experimental results, a comparative discussion is provided particularly regarding memory and time consumption for analyzing diagnosability of the three techniques.

Diagnosability Analysis of Discrete Event Systems Using a Compact State Space Representation

2021 ◽  
Author(s):  
Xiaoting Zhang ◽  
Jiafeng Zhang ◽  
Zhong Zheng ◽  
Hanyu Zheng ◽  
Minglong Pu ◽  
...  
Keyword(s):  
State Space ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Space Representation ◽  
State Space Representation ◽  
Event Systems ◽  
Compact State

scholarly journals Petri nets properties related to the unboundness and analyzed using coverability multigraph

2014 ◽  
Vol 10 (2) ◽  
pp. 51-67 ◽  
Author(s):  
Branislav Hrúz ◽  
Iveta Dirgová Ľuptáková ◽  
Miroslav Beňo
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
System Model ◽  
Reachability Graph ◽  
Reachability Set ◽  
Event Systems ◽  
System States

Abstract Petri nets represent a powerful tool for modeling the discrete event systems. The Petri net markings correspond to the system states. The infinity of the marking set means that the Petri net is unbounded and this may be the sign of an incorrect system model. In that case instead of the reachability set and the reachability graph the coverability set and the coverability multigraph can be used to represent the Petri net state space. A systematic way of building the notion of the coverability set and coverability multigraph based on the notion of the ω -marking is given in the paper. Algorithm for its construction is introduced. Then the use of the coverability multigraph for the analysis of several properties of the unbounded Petri nets is described.

Sign in / Sign up

Export Citation Format

Share Document