Incremental construction of coverability graphs

DOI10.1016/j.ipl.2007.04.002zbMath1184.68345OpenAlexW2079417052MaRDI QIDQ2379973

Vitali Kozioura, Barbara König

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

Petri netsformal methodsconcurrencycoverability

Mathematics Subject Classification ID

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

Related Items (2)

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

Uses Software

• Augur 2

Cites Work

• Unnamed Item
• Unnamed Item
• Petri nets are monoids
• Petri nets and regular languages
• Parallel program schemata
• An Algorithm for the General Petri Net Reachability Problem
• Handbook of Graph Grammars and Computing by Graph Transformation
• Applications and Theory of Petri Nets 2004

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