From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

DOI10.1007/978-3-540-73094-1_10MaRDI QIDQ3612929zbMATH OpenOpenAlexFDO

Authors Pierre Ganty, Laurent Van Begin, Jean-François Raskin

Publication date 11 March 2009

Published in Petri Nets and Other Models of Concurrency – ICATPN 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73094-1_10

Mathematics Subject Classification ID

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

Recommendations

• From many places to few: automatic abstraction refinement for Petri nets
• Abstraction-based incremental inductive coverability for Petri nets
• Refining and verifying regular Petri nets
• Applying CEGAR to the Petri net state equation
• Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Cited in

(6)

• Abstraction-based incremental inductive coverability for Petri nets
• A Forward-Backward Abstraction Refinement Algorithm
• Une nouvelle transformation des réseaux de Petri généralisés : L'abstraction généralisée
• Automated polyhedral abstraction proving
• From many places to few: automatic abstraction refinement for Petri nets
• Petri nets for modelling metabolic pathways: a survey

This page was built for publication: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

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