Extensions to the CEGAR approach on Petri nets

DOI10.14232/ACTACYB.21.3.2014.8zbMATH Open1313.68080DBLPjournals/actaC/HajduVBM14OpenAlexW2296663577WikidataQ57086294 ScholiaQ57086294MaRDI QIDQ2937547FDOQ2937547

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

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

zbMATH Keywords

abstractionPetri netsreachability analysisCEGAR

Mathematics Subject Classification ID

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

Cited In (10)

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

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)