Design, Analysis and Verification of Real-Time Systems Based on Time Petri Net Refinement

Ding, Zhijun; Jiang, Changjun; Zhou, MengChu

doi:10.1145/2406336.2406340

Cited by 25 publications

(5 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other future work includes its extension to more sophisticated manufacturing‐oriented Petri nets, e.g. .…”

Section: Resultsmentioning

confidence: 99%

“…Petri nets are used widely to deal with the deadlock control problems in discrete event systems (DES) , especially in flexible manufacturing systems (FMS) . In the past two decades, efforts were made to solve the problems of computational complexity, structural complexity, and behavior permissiveness in designing liveness‐enforcing supervisors .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design of a Maximally Permissive Liveness‐enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems

Wang¹,

Zhou²,

Wu³

2014

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

This paper deals with the problems of computational and structural complexity in designing maximally permissive liveness-enforcing supervisors for a class of Petri nets called Systems of Simple Sequential Processes with Resources (S 3 PR) without ξ-resources. The supervisor consists of two parts: the first part proposes an algorithm to extract a desired emptied strict minimal siphon (SMS) from a given emptied siphon based on loop resource subsets. This is faster than the existing ones. The second part proposes a siphon-based deadlock prevention policy, which can obtain a maximally permissive liveness-enforcing supervisor with reduced structural complexity and no weighted monitors, owing to the contribution of the first part, which can compute a desired SMS such that one with the smallest number of resource places is selected first for control. Several flexible manufacturing systems are used to show the proposed method and its superior performance over the previous ones.

show abstract

“…Other future work includes its extension to more sophisticated manufacturing‐oriented Petri nets, e.g. .…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Design of a Maximally Permissive Liveness‐enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems

Wang¹,

Zhou²,

Wu³

2014

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

show abstract

“…The definitions of Petri nets, 14–17 multisets, CPN, and binding 18 are abridged in this paper.

B O O L

is the set of Boolean predicates with standard logic operations.…”

Section: Preliminariesmentioning

confidence: 99%

Change‐aware model checking for evolving concurrent programs based on Program Dependence Net

Li,

Chen,

Huang

et al. 2023

J Software Evolu Process

Self Cite

View full text Add to dashboard Cite

SummaryConcurrent software needs to be maintained over time, and the differences between continuous versions tend to be localized. The expense that simply reapplying standard model checking techniques to the new version as they evolve may be infeasible. The existing methods reuse partial state‐space to reduce the scope. However, it is obviously costly to analyze on the explosive interleaving space of the evolving concurrent programs. The conservative change‐impact analysis methods without considering the specific property and leveraging the verified result from the prior version often results in exploring redundant state‐space irrelevant to this property. Moreover, the impact of the deleted elements needs to be analyzed on old version, and their impact needs to be mapped to new version, bringing some dispensable costs. In this paper, we propose a change‐aware model checking method based on program dependence net (PDNet) for linear temporal logic (LTL). We first propose an incremental modeling method to construct a PDNet of new version by modification rules. Then, we propose a reuse checking algorithm to judge whether the verified result can be reused based on the PDNet slice. Finally, we implement change‐aware model checking tool (DAMER) and validate the advantages of our methods.

show abstract

“…In our formal setting, proving that an FBD implementation is correct (with respect to its intended input-output timing requirements) is essentially proving that it is a valid refinement. However, our purpose of verification is on the observable input-output behaviour, as opposed other properties such as boundedness, liveness, and robustness (e.g., [3,16,13,2]). Of more relevance is the use of timed automata to model timing tolerances with ASAP (as soon as possible) semantics to verify the correctness of implementation [17], but with no suggestion for either tool support or its adoption in practice.…”

Section: Related Workmentioning

confidence: 99%

“…Fig. 4 shows, extracted from IEC 61131-3, the input-output declaration (on the LHS) and a timing diagram 3 (on the RHS) illustrating the expected behaviour of the TON block. The TON block is declared with two inputs (a boolean condition IN and a time period of length PT) and two outputs (a boolean value Q and a length ET of time period).…”

Section: Modelling Samples In the Software Domainmentioning

confidence: 99%

Formal Verification of Real-Time Function Blocks Using PVS

Pang

Wang

Lawford

et al. 2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

A critical step towards certifying safety-critical systems is to check their conformance to hard realtime requirements. A promising way to achieve this is by building the systems from pre-verified components and verifying their correctness in a compositional manner. We previously reported a formal approach to verifying function blocks (FBs) using tabular expressions and the PVS proof assistant. By applying our approach to the IEC 61131-3 standard of Programmable Logic Controllers (PLCs), we constructed a repository of precise specification and reusable (proven) theorems of feasibility and correctness for FBs. However, we previously did not apply our approach to verify FBs against timing requirements, since IEC 61131-3 does not define composite FBs built from timers. In this paper, based on our experience in the nuclear domain, we conduct two realistic case studies, consisting of the software requirements and the proposed FB implementations for two subsystems of an industrial control system. The implementations are built from IEC 61131-3 FBs, including the on-delay timer. We find issues during the verification process and suggest solutions.

show abstract

Design, Analysis and Verification of Real-Time Systems Based on Time Petri Net Refinement

Cited by 25 publications

References 32 publications

Design of a Maximally Permissive Liveness‐enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems

Design of a Maximally Permissive Liveness‐enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems

Change‐aware model checking for evolving concurrent programs based on Program Dependence Net

Formal Verification of Real-Time Function Blocks Using PVS

Contact Info

Product

Resources

About