Liveness, Deadlock-Freeness, and Siphons

View Sample PDF

Author(s): Kamel Barkaoui (CEDRIC-CNAM – Paris, France)
Copyright: 2013
Pages: 14
Source title: Embedded Computing Systems: Applications, Optimization, and Advanced Design
Source Author(s)/Editor(s): Mohamed Khalgui (Xidian University, China), Olfa Mosbahi (University of Carthage, Tunisia)and Antonio Valentini (O3neida Europe, Belgium)
DOI: 10.4018/978-1-4666-3922-5.ch003

Keywords: Computer Science & IT / Information Science Reference / Systems & Software Design / Systems and Software Engineering

Purchase

View Liveness, Deadlock-Freeness, and Siphons on the publisher's website for pricing and purchasing information.

Abstract

This chapter deals with the structure theory of Petri nets. The authors define the class of P/T systems, namely K-systems, for which the equivalence between controlled-siphon, deadlock-freeness, and liveness properties holds. Using the new structural notions of ordered transitions and root places, they revisit the non-liveness characterization of P/T systems satisfying the cs-property and define by syntactical manner new and more expressive subclasses of K-systems where the interplay between conflict and synchronization is relaxed.

The IRMA Community

Research IRM

Liveness, Deadlock-Freeness, and Siphons

Purchase

Abstract

Related Content

IRMA Sponsors