Observable Liveness

Abstract. Whereas the traditional liveness property for Petri nets guarantees that each transition can always occur again, observable liveness requires that, from any reachable marking, each observable transition can be forced to fire by choosing appropriate controllable transitions; hence it is defined for Petri nets with distinguished observable and controllable transitions. We introduce observable liveness and show this new notion generalizes liveness in the following sense: liveness of a net implies observable liveness, provided the only conflicts that can appear are between controllable transitions. This assumption refers to applications where the uncontrollable part models a deterministic machine (or several deterministic machines), whereas the user of the machine is modeled by the controllable part and can behave arbitrarily.

[1]  Manuel Silva,et al.  Half a century after Carl Adam Petri's Ph.D. thesis: A perspective on the field , 2013, Annu. Rev. Control..

[2]  Jörg Desel,et al.  A Guide to Modelling and Control with Modules of Signal Nets , 2004, SoftSpez Final Report.

[3]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[4]  Giovanni Denaro,et al.  Petri Nets and Software Engineering , 2003, Lectures on Concurrency and Petri Nets.

[5]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[6]  Christos T. Karamanolis,et al.  Elements of distributed algorithms-modeling and analysis with petri nets Wolfgang Reisig [Book review] , 1999, IEE Proceedings - Software.

[7]  Wolfgang Reisig,et al.  Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness , 1984, ICALP.

[8]  Panos J. Antsaklis,et al.  Design of T-liveness enforcing supervisors in Petri nets , 2003, IEEE Trans. Autom. Control..

[9]  Edward L. Robertson,et al.  Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[10]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[11]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.

[12]  Rolf Hennicker,et al.  Specification of Asynchronous Component Systems with Modal I/O-Petri Nets , 2013, TGC.

[13]  Ursula Goltz,et al.  On Causal Semantics of Petri Nets , 2011, CONCUR.

[14]  Serge Haddad,et al.  A reduction theory for coloured nets , 1988, European Workshop on Applications and Theory in Petri Nets.

[15]  Wolfgang Reisig,et al.  Understanding Petri Nets Modeling Techniques, Analysis Methods, Case Studies , 2013, Bull. EATCS.

[16]  Alessandro Giua,et al.  A Survey of Petri Net Methods for Controlled Discrete Event Systems , 1997, Discret. Event Dyn. Syst..

[17]  Jörg Desel,et al.  Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) , 2005 .