Petri nets play a central role in the analysis of discrete, parallel and distributed systems. Reachability problem is one of the analysis of Petri nets. This paper address the analysis of reachable marking of petri nets using invariants. We translate Petri nets as transition systems. Then, through computing vanishing ideal of sample points, we present a new approach for constructing polynomial equation invariants of Petri nets. Our approach avoids first-order quantifier elimination and cylindrical algebraic decomposition. From the preliminary experiment results, we demonstrate the feasibility of our approach.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Generating Inductive Invariants for Petri Nets


    Weitere Titelangaben:

    Adv.Intel.,Soft Computing


    Beteiligte:
    Xie, Anne (Herausgeber:in) / Huang, Xiong (Herausgeber:in) / Wu, Bin (Autor:in) / Fu, YongJun (Autor:in)


    Erscheinungsdatum :

    2012-01-01


    Format / Umfang :

    8 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Reversibility Analysis for Petri Nets by Using T-invariants

    Ozkan, H.A. / Aybar, A. / WSEAS (Organization) | British Library Conference Proceedings | 2008


    Partition by Place Invariants and Discrimination of Its Properties in Petri Nets

    Miyazawa, I. / Sekiguchi, T. | British Library Online Contents | 1996


    Generating Real-time Software Test Cases by Time Petri Nets

    Lin, J. C. / Ho, I. | British Library Online Contents | 2000


    A logic for Petri nets

    Pradier-Chezalviel, B. / Valette, R. | British Library Online Contents | 1997


    Airport Traffic Simulation Using Petri Nets

    Skorupski, J. | British Library Conference Proceedings | 2013