Incremental construction of coverability graphs

DOI10.1016/J.IPL.2007.04.002MaRDI QIDQ2379973zbMATH OpenOpenAlexFDO

Authors Barbara König, Vitali Kozioura

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.04.002

zbMATH Keywords

concurrencycoverabilityformal methodsPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A static analysis technique for graph transformation systems
• An Algorithm for the General Petri Net Reachability Problem
• Finite unfoldings of unbounded Petri nets
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• Parallel program schemata
• Petri nets and regular languages
• Petri nets are monoids

Cited in

(2)

• Checking system boundedness using ordinary differential equations
• A framework for the verification of infinite-state graph transformation systems

Describes a project that uses

Uses Software

• Augur 2

This page was built for publication: Incremental construction of coverability graphs

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