1993Transactions of the Society of Instrument and Control EngineersOpen access

Mutually Exclusive State-Feedback Control of State Machines and Deadlocks of the Resulting System

Tomohisa Matsumoto, Tomiji Hisamura

Open full text 0 citations

Abstract

This paper treats deadlocks and liveness of the closed-loop discrete event system GSCSM|f consisting of a strongly connected state machine (SCSM), a subclass of Petri nets, and a state-feedback which realizes the mutually exclusive control.The GSCSM|f is not always live even if the original SCSM is live, and deadlocks exist in GSCSM|f.A deadlock marking is newly defined and the D-net is proposed to detect these deadlock markings.Then the relation between deadlock freeness and liveness is analysed.Under an assumption, it is shown that the existence of the place set called DPS in D-net is the necessary and sufficient condition for the existence of deadlock markings, and that deadlock freeness is equivalent to the liveness.Furthermore, defining LPS as a special class of DPS, we show that if DPS/LPS exists, the sufficient condition for liveness is that the initial token count │M0│ satisfies the equation 1≦│M0│≦ min │DPS/LPS│-1.

Open-access reader

About this research paper

What this paper is about

This paper treats deadlocks and liveness of the closed-loop discrete event system GSCSM|f consisting of a strongly connected state machine (SCSM), a subclass of Petri nets, and a state-feedback which realizes the mutually exclusive control.The GSCSM|f is not always live even if the original SCSM is live, and deadlocks exist in GSCSM|f.A deadlock marking is newly defined and the D-net is proposed to detect these deadlock markings.Then the relation between deadlock freeness and liveness is analysed.Under an assumption, it is shown that the existence of the place set called DPS in D-net is the necessary and sufficient condition for the existence of deadlock markings, and that deadlock freeness is equivalent to the liveness.Furthermore, defining LPS as a special class of DPS, we show that if DPS/LPS exists, the sufficient condition for liveness is that the initial token count │M0│ satisfies the equation 1≦│M0│≦ min │DPS/LPS│-1.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper treats deadlocks and liveness of the closed-loop discrete event system GSCSM|f consisting of a strongly connected state machine (SCSM), a subclass of Petri nets, and a state-feedback which realizes the mutually exclusive control.The GSCSM|f is not always live even if the original SCSM is live, and deadlocks exist in GSCSM|f.A deadlock marking is newly defined and the D-net is proposed to detect these deadlock markings.Then the relation between deadlock freeness and liveness is analysed.Under an assumption, it is shown that the existence of the place set called DPS in D-net is the necessary and sufficient condition for the existence of deadlock markings, and that deadlock freeness is equivalent to the liveness.Furthermore, defining LPS as a special class of DPS, we show that if DPS/LPS exists, the sufficient condition for liveness is that the initial token count │M0│ satisfies the equation 1≦│M0│≦ min │DPS/LPS│-1.

Key concepts: Liveness, Petri net, Deadlock, Deadlock prevention algorithms, State (computer science), Security token, Computer science, Control (management)

Related papers

Back to paper searchBrowse research topicsOriginal source
Mutually Exclusive State-Feedback Control of State Machines and Deadlocks of the Resulting System — Research Paper | ScholarLens