Analysis of approximate Petri nets by means of occurrence graphs

MaRDI QIDQ5422296zbMATH OpenFDO

Authors Zbigniew Suraj, Barbara Fryc

Publication date 17 October 2007

zbMATH Keywords

approximate reasoningknowledge representationoccurrence graphsapproximate Petri nets

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Rough Sets and Current Trends in Computing
• Timed approximate Petri nets
• A Petri net system -- an overview
• scientific article; zbMATH DE number 750184
• Weighted generalized fuzzy Petri nets and rough sets for knowledge representation and reasoning

Cited in

(2)

• Rough Sets and Current Trends in Computing
• A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets

This page was built for publication: Analysis of approximate Petri nets by means of occurrence graphs

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