scientific article; zbMATH DE number 1799527

MaRDI QIDQ3146285zbMATH OpenFDO

Authors Józef Winkowski

Publication date 11 September 2002

zbMATH Keywords

concurrent systemscontextual netsPetri nets

Mathematics Subject Classification ID

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

Recommendations

• The reachability problem for object nets
• Reachability in choice networks
• scientific article; zbMATH DE number 4215383
• Reachability analysis based on structured representations
• Constraint-based reachability
• Approximating Petri net reachability along context-free traces
• Observability of place/transition nets
• Reachability in conditional term rewriting systems

Cited in

(11)

• Contextual nets
• Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
• Towards a Theory of Reach
• Verification of Petri nets with read arcs
• Non-atomic transition firing in contextual nets
• Universality in infinite Petri nets
• Efficient Contextual Unfolding
• scientific article; zbMATH DE number 4215383 (Why is no real title available?)
• McMillan’s Complete Prefix for Contextual Nets
• Efficient unfolding of contextual Petri nets
• Construction and SAT-based verification of contextual unfoldings

This page was built for publication:

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