Property analysis of logic Petri nets by marking reachability graphs

DOI10.1007/S11704-014-3002-9MaRDI QIDQ2515425zbMATH OpenOpenAlexFDO

Authors Yuhui Ning, YuYue Du

Publication date 5 August 2015

Published in Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11704-014-3002-9

zbMATH Keywords

enabled conditionfairnesslogic Petri netsreachable marking graphreversibility

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4074502
• scientific article; zbMATH DE number 2112159
• Analysis of Petri nets with a dynamic priority method
• Characterisation of the state spaces of marked graph Petri nets
• scientific article; zbMATH DE number 4074503

Cites work

• Analysis issues in Petri nets with inhibitor arcs
• scientific article; zbMATH DE number 1949602 (Why is no real title available?)
• Liveness of an extended S\(^{3}\)PR
• Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
• Steady Homann flow and heat transfer of an electrically conducting second grade fluid

Cited in

(2)

• scientific article; zbMATH DE number 1949602 (Why is no real title available?)
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings

This page was built for publication: Property analysis of logic Petri nets by marking reachability graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515425)