Marking Estimation of P-Time Petri Nets With Unobservable Transitions

Bonhomme, Patrice

doi:10.1109/tsmc.2014.2353575

Cited by 22 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Petri nets (PNs) which is a well-suited model for discrete event systems, temporal intervals can be associated with places or transitions for Time PNs, but the corresponding subclasses ( P-Time PNs and T-Time PNs ) are fundamentally different and must not be confused. In Time PNs [16], a temporal interval of firing is associated with each transition enabled by the marking while a temporal interval of availability is associated with each token which enters a place in P-Time PNs [2] [3] [8] [9]. In this paper, we focus on P-time PNs whose evolution can undergo token deaths which express the loss of resources or parts and failures to meet time specifications.…”

Section: A Aim and Motivationmentioning

confidence: 99%

“…Applications can be found in many fields as production systems, food industry and transportation systems [7] [1] [10]. Up to now, the consideration of the time factor as intervals in P-time PNs containing conflicts and synchronizations, remains an open problem in estimation as, at the best of our knowledge, only few papers have considered this type of general model: [2] [3] provide an estimation of marking sets consistent with an observed label sequence.…”

Section: A Aim and Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis

Declerck

Bonhomme

2023

International Journal of Control

View full text Add to dashboard Cite

In this paper, we consider the on-line estimation of current subsequences for Partially Observable P-time Petri Nets and their starting markings on a sliding horizon composed of steps defined by two successive occurrences of observable transition firings. We propose a general strategy composed of two phases: Phase 1 exploits a simplification of the P-time Petri net under the form of a Timed Petri net; considering a candidate count vector and the relevant starting marking proposed at Phase 1, Phase 2 makes a schedulability analysis by building a system of relations which can be represented by an acyclic conflict-free computation graph. The complete approach avoids the generation of sets which is generally time and space consuming, and provides an optimal solution for each subproblem by using efficient standard tools.

show abstract

Section: A Aim and Motivationmentioning

confidence: 99%

Section: A Aim and Motivationmentioning

confidence: 99%

Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis

Declerck

Bonhomme

2023

International Journal of Control

View full text Add to dashboard Cite

show abstract

“…They used satisfiability modulo theory to address the complexity of secure state estimation. Bonhomme [33] proposed a method to assess the marking of an unlabeled P-time Petri net with unobservable transitions. This method used the candidate firing sequences to estimate the marking.…”

Section: Related Workmentioning

confidence: 99%

Vulnerability Evaluation Method for E-Commerce Transaction Systems With Unobservable Transitions

2020

View full text Add to dashboard Cite

E-commerce transaction systems have become an important factor in trading activities. However, e-commerce systems are still undergoing development. Unobservable actions and attacks on systems are frequent problems that increase the vulnerability of e-commerce systems. Most existing approaches to addressing these issues cannot describe or analyze the overall structure of a local specification and unobservable actions well. The vulnerable e-commerce transaction net (VET-net) is a useful model for describing the unobservable actions, online transactions and third-party payment platforms of e-commerce systems. Based on a VET-net, we focus on the detection and evaluation of e-commerce transaction systems to attacks. We propose the concept of vulnerable transitions, which include not only vulnerable actions but also unobservable transitions. Then, we use an improved slice method to locate the vulnerable transitions. For these vulnerable transitions, we propose a vulnerable transition evaluation method based on a hidden Markov model along with a reachability graph (HMM-RG). The HMM-RG uses hidden Markov models (HMMs) to approximate the state reachability graph of a VET-net. By calculating the firing probability, the HMM-RG can evaluate the vulnerability degree of malicious states. We use a real-world case to show our method's effectiveness and reasonability.

show abstract

“…The problems of state estimation and property verification have also drawn many attentions in the context of Petri nets. For example, state (marking) estimation algorithms for Petri nets have been proposed in [3,10,33,49]. Decidability and verification procedures for diagnosability [4,9,12,63,122], detectability [32,57], prognosability [115] and opacity [101,102] are also studied in the literature for Petri nets.…”

Section: Estimation and Verification Of Petri Nets And Stochastic Desmentioning

confidence: 99%

Estimation and Verification of Partially Observed Discrete‐Event Systems

Yin

2019

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

State estimation is one of the most fundamental problems in the systems and control theory. In many real-world systems, it is not always possible to access the full information of the system due to measurement noises/uncertainties and the existence of adversaries. Therefore, how to estimate the state of the system is crucial when one wants to make decisions based on the limited and incomplete information.Given a system, one of the most important questions is to prove/disprove the correctness of the system with respect to some desired requirement (or specification). In particular, we would like to check the correctness of the system in a formal manner in the sense that the checking procedures are algorithmic and results have provable correctness guarantees. Such a formal satisfaction checking problem is referred to as the verification problem. Performing formal property verification is very important for many complicated but safety-critical infrastructures.This article considers state estimation and verification problems for an important class of man-made cyber-physical systems called Discrete-Event Systems (DES). Roughly speaking, DES are dynamic systems with discrete state-spaces and event-triggered dynamics. DES models are widely used in the study of complex automated systems where the behavior is inherently eventdriven, as well as in the study of discrete abstractions of continuous, hybrid, and/or cyber-physical systems. Over the past decades, the theory of DES has been successfully applied to many real-world problems, e.g., the control of

show abstract

Marking Estimation of P-Time Petri Nets With Unobservable Transitions

Cited by 22 publications

References 18 publications

Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis

Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis

Vulnerability Evaluation Method for E-Commerce Transaction Systems With Unobservable Transitions

Estimation and Verification of Partially Observed Discrete‐Event Systems

Contact Info

Product

Resources

About