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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Generating Inductive Invariants for Petri Nets


    Additional title:

    Adv.Intel.,Soft Computing


    Contributors:
    Xie, Anne (editor) / Huang, Xiong (editor) / Wu, Bin (author) / Fu, YongJun (author)


    Publication date :

    2012-01-01


    Size :

    8 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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 New Scheme for Verifying Rule-Based Systems by Using Net-Invariants of Petri Nets

    Inazumi, H. / Omoto, N. | British Library Online Contents | 2000


    A logic for Petri nets

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