14 citations · 19 across the 6 of their papers we have counts for
6 papers
Supervisory Control with Event Forcing Under Partial Observation
Yin Tong, Kai Cai
In this paper, we address supervisory control in discrete-event systems with event forcing. In particular, partial observation of the supervisor is considered. Unlike traditional s…
Benchmarks of Extended Basis Reachability Graphs
Yin Tong
In this note, we want to provide a comparison among the efficiency of different approaches for the verification of K-step and infinite-step opacity based on three different graphs:…
Verification of infinite-step and K-step opacity Using Petri Nets
Hao Lan, Yin Tong, Jin Guo +1
This paper addresses the problem of infinite-step opacity and K-step opacity of discrete event systems modeled with Petri nets. A Petri net system is said to be infinite-step/K-ste…
Verification of Detectability Using Petri Nets and Detector
Hao Lan, Yin Tong, Jin Guo +1
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 compl…
Verification of Detectability in Petri Nets Using Verifier Nets
Hao Lan, Yin Tong, Carla Seatzu +1
Detectability describes the property of a system whose current and the subsequent states can be uniquely determined after a finite number of observations. In this paper, we develop…
Verification of C-detectability Using Petri Nets
Hao Lan, Yin Tong, Jin Guo +1
Detectability describes the property of an system whose current and the subsequent states can be uniquely determined after a finite number of observations. In this paper, we relax…