-Petri nets: algorithms and complexity

DOI10.3233/FI-2015-1169MaRDI QIDQ2805418zbMATH OpenOpenAlexFDO

Authors G. Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1169

Mathematics Subject Classification ID

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

Recommendations

• \(\omega \)-Petri nets
• On the high complexity of Petri nets \(\omega \)-languages
• On the \(\omega\)-language expressive power of extended Petri nets
• On the \(\omega\)-language expressive power of extended Petri nets
• Complexity analysis of continuous Petri nets

Cited in

(9)

• On Petri nets with hierarchical special arcs
• Parameterized Analysis of Immediate Observation Petri Nets
• Accelerations for the coverability set of Petri nets with names
• Complexity results for problems of communication-free Petri nets and related formalisms
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Coverability synthesis in parametric Petri nets
• A well-structured framework for analysing Petri net extensions
• \(\omega \)-Petri nets

This page was built for publication: \(\omega\)-Petri nets: algorithms and complexity

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