Extensions to the CEGAR approach on Petri nets

DOI10.14232/ACTACYB.21.3.2014.8MaRDI QIDQ2937547zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ákos Hajdu, András Vörös, Tamás Bartha, Zoltán Mártonka

Publication date 9 January 2015

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.21.3.2014.8

zbMATH Keywords

abstractionPetri netsreachability analysisCEGAR

Mathematics Subject Classification ID

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

Recommendations

• New search strategies for the Petri net CEGAR approach
• Applying CEGAR to the Petri net state equation
• Applying CEGAR to the Petri net state equation
• Monotonic extensions of Petri nets: forward and backward search revisited
• Approaching the coverability problem continuously

Cited in

(10)

• Applying CEGAR to the Petri net state equation
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic
• Solving finite-linear-path CTL-formulas using the CEGAR approach
• scientific article; zbMATH DE number 4060688 (Why is no real title available?)
• Monotonic extensions of Petri nets: forward and backward search revisited
• Applying CEGAR to the Petri net state equation
• Process of petri nets extension
• Optimal trajectory generation for Petri nets
• New search strategies for the Petri net CEGAR approach
• A calculus for automatic verification of Petri nets based on resolution and dynamic logics

This page was built for publication: Extensions to the CEGAR approach on Petri nets

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