Dependency graph: An algorithm for analysis of generalized parameterized networks

Zibaeenejad, M. H.; Thistle, J. G.

doi:10.1109/acc.2015.7170816

Cited by 6 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we characterize dependencies between subprocesses of any instances of a PCN by means of a single, finite dependency graph. In a preliminary form, the dependency graph was introduced in [11], where it was conjectured it can be used to detect reachable partial deadlocks of a PCN. Here we prove that specific subgraphs of the dependency graph represent reachable generalized circular waits of instances of the PCN.…”

Section: Introductionmentioning

confidence: 99%

Deadlock Analysis of Parameterized-Chain Networks

Zibaeenejad

Thistle

2017

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

In areas such as computer software and hardware, manufacturing systems, and transportation, engineers encounter networks with arbitrarily large numbers of isomorphic subprocesses. Parameterized systems provide a framework for modeling such networks. The analysis of parameterized systems is a challenge as some key properties such as nonblocking and deadlock-freedom are undecidable even for the case of a parameterized system with ring topology. In this paper, we introduce Parameterized-Chain Networks (PCN) for modeling of networks containing several linear parameterized segments. Since deadlock analysis is undecidable, to achieve a tractable subproblem we limit the behavior of subprocesses of the network using our previously developed mathematical notion 'weak invariant simulation.' We develop a dependency graph for analysis of PCN and show that partial and total deadlocks of the proposed PCN are characterized by full, consistent subgraphs of the dependency graph. We investigate deadlock in a traffic network as an illustrative example.

show abstract

Section: Introductionmentioning

confidence: 99%

Deadlock Analysis of Parameterized-Chain Networks

Zibaeenejad

Thistle

2017

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

show abstract

“…is fired at state q γ , then CE returns to the initial state q wait , waiting to receive a new control command; if an unobservable event σ ∈ Σ uo ∩ (γ ∪ Σ uc ) is fired at q γ instead, the command execution automaton self-loops at state q γ as the same control command γ is to be used for the next event execution. This is reflected in Rule ( 5) and Rule (6), respectively. In particular, if an unobservable event σ is fired at state q γ , the control commands received within the next time step will be thrown away, as reflected in Rule ( 4) and Rule (6) combined.…”

Section: Network Control Architecturementioning

confidence: 99%

“…The cases of controllability and observability are specially treated, as any plant event is assumed to consume one time step, in our model of time, following [6]. Similar analysis can be applied to the case when num c ≥ 1 and OC CC A m CE G S m+1 S f is the networked closed-loop system.…”

Section: Gmentioning

confidence: 99%

“…The supervisory control theory is mainly applied in the complex manufacturing system [2] [3], database management system [4], wired/wireless communication networks [5], and transportation systems [6]. Also, there are some properties requirements proposed to ensure the controllability, observability, certain safety and nonblockingness [7] [8] [9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Networked supervisory control with imperfect communication channels

Zhu¹

View full text Add to dashboard Cite

for his great guidance and continuous encouragement over the last several years. His excellent academic resource and research styles have lighted me to become a qualified Ph.D. student. In addition, I would like to thank Dr. Lin Liyong and Mr. Sun Chunyang for their great help and advice during my Ph.D. program. I appreciate and enjoy the academic communication with Dr. Lin Liyong and Mr. Tai Ruochen. My deepest gratitude goes to my parents for their unlimited love and encouragement. I would like to thank my roommates who always support me. I would also like to thank the colleagues and friends in Delta-NTU Corporate Lab; they help me a lot both in my study and life.

show abstract

“…The theory of supervisory control of discrete-event systems was originally initiated in the 1980s by Ramadge and Wonham [14], [15], [16], [17] and has been under active development for more than 30 years (see the textbooks and monographs [13], [18], [19]). The main domains of applications for supervisory control theory are the coordination of complex man-made systems such as manufacturing systems [13], [20], [21], telecommunication and network protocols [22], [23], database management sytems [24] and transportation [13], [25], e.t.c., where coordination and conflict resolution [26], [27], [28] are usually needed to ensure certain safety and liveness properties. A brief list of some of the more important developments and those developments that are more closely related to ours is provided below.…”

Section: Control Of Discrete-event Systemsmentioning

confidence: 99%

Towards decentralized and parameterized supervisor synthesis

Lin¹

View full text Add to dashboard Cite

This thesis studies the decentralized and parameterized supervisor synthesis problems in the Ramadge-Wonham paradigm. We obtain a characterization of the solvability of the decentralized realization problem, by reducing it to the problem of solving a set of language equations. The close relationship among the problems of language decomposition, supervisor decomposition and decentralized realization is then studied. Complexity-theoretic lower bound proofs are provided by reductions from the language decomposition problem. We then develop complexity reduction techniques for language decomposability verification. A sufficient condition for the undecidability of the distributed supervisor synthesis problem is derived based on the structure of the distributed control architecture. We also present a sufficient condition for the undecidability of a language based parameterized supervisor synthesis problem. The expressive power of the symbolic reachability relations of a class of parameterized systems is investigated and a sound state based parameterized supervisor synthesis procedure is develped in the frameowrk of regular model checking.

show abstract

Dependency graph: An algorithm for analysis of generalized parameterized networks

Cited by 6 publications

References 7 publications

Deadlock Analysis of Parameterized-Chain Networks

Deadlock Analysis of Parameterized-Chain Networks

Networked supervisory control with imperfect communication channels

Towards decentralized and parameterized supervisor synthesis

Contact Info

Product

Resources

About