Computing Minimal Elements of Upward-Closed Sets for Petri Nets

DOI10.1007/978-3-540-73094-1_27MaRDI QIDQ3612947zbMATH OpenOpenAlexFDO

Authors Hsu-Chun Yen, Chien-Liang Chen

Publication date 11 March 2009

Published in Petri Nets and Other Models of Concurrency – ICATPN 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73094-1_27

Mathematics Subject Classification ID

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

Recommendations

• On minimal elements of upward-closed sets
• scientific article; zbMATH DE number 7204383
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• The residue of vector sets with applications to decidability problems in Petri nets
• On the efficient computation of the minimal coverability set of Petri nets

Cited in

(4)

• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• On minimal elements of upward-closed sets
• A new approach to upward-closed set backward reachability analysis
• Minimal generating sets for semiflows

This page was built for publication: Computing Minimal Elements of Upward-Closed Sets for Petri Nets

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