Coverability synthesis in parametric Petri nets

DOI10.4230/LIPICS.CONCUR.2017.14MaRDI QIDQ5111627zbMATH OpenFDO

Authors N. David, Claude Jard, Didier Lime, Olivier H. Roux

Publication date 27 May 2020

zbMATH Keywords

parameterssynthesisPetri netunboundednesscoverability

Mathematics Subject Classification ID

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

Recommendations

• Discrete parameters in Petri nets
• \(\omega\)-Petri nets: algorithms and complexity
• \(\omega \)-Petri nets

Cites work

• scientific article; zbMATH DE number 46872 (Why is no real title available?)
• scientific article; zbMATH DE number 1304329 (Why is no real title available?)
• Branching Processes of General Petri Nets
• Decision problems for lower/upper bound parametric timed automata
• Discrete parameters in Petri nets
• Forward Analysis for WSTS, Part II: Complete WSTS
• Forward analysis for WSTS. I: Completions
• Integer Parameter Synthesis for Timed Automata
• On selective unboundedness of VASS
• Parallel program schemata
• Parametric real-time reasoning
• Relationships between nondeterministic and deterministic tape complexities
• The residue of vector sets with applications to decidability problems in Petri nets
• \(\omega\)-Petri nets: algorithms and complexity

Cited in

(3)

• Discrete parameters in Petri nets
• Parameterized Analysis of Immediate Observation Petri Nets
• Parameterized complexity and approximability of coverability problems in weighted Petri nets

This page was built for publication: Coverability synthesis in parametric Petri nets

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