Coverability synthesis in parametric Petri nets

DOI10.4230/LIPICS.CONCUR.2017.14zbMATH Open1442.68133MaRDI QIDQ5111627FDOQ5111627

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

Publication date: 27 May 2020

Recommendations

• Discrete parameters in Petri nets
• Small vertex cover makes Petri net coverability and boundedness easier
• Small vertex cover makes Petri net coverability and boundedness easier
• \(\omega\)-Petri nets: algorithms and complexity
• \(\omega \)-Petri nets

zbMATH Keywords

parameterssynthesisPetri netunboundednesscoverability

Mathematics Subject Classification ID

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

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Parallel program schemata
• Branching Processes of General Petri Nets
• Forward Analysis for WSTS, Part II: Complete WSTS
• Forward analysis for WSTS. I: Completions
• On selective unboundedness of VASS
• Title not available (Why is that?)
• The residue of vector sets with applications to decidability problems in Petri nets
• Parametric real-time reasoning
• Decision problems for lower/upper bound parametric timed automata
• Integer Parameter Synthesis for Timed Automata
• Title not available (Why is that?)
• \(\omega\)-Petri nets: algorithms and complexity
• Discrete Parameters in 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)