Commodification of accelerations for the Karp and Miller construction

DOI10.1007/s10626-020-00331-zzbMath1478.93393OpenAlexW3100424414MaRDI QIDQ2058566

Alain Finkel, Igor Khmelnitsky, Serge Haddad

Publication date: 9 December 2021

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-03137054/file/JDEDS.pdf

zbMATH Keywords

Petri netscoverabilityverification tool

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Cites Work

• Reduction and covering of infinite reachability trees
• Minimal coverability tree construction made complete and efficient
• Parallel program schemata
• An SMT-Based Approach to Coverability Analysis
• Constructing Minimal Coverability Sets
• Forward Analysis for WSTS, Part II: Complete WSTS
• ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS
• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
• The Logical View on Continuous Petri Nets
• Old and New Algorithms for Minimal Coverability Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Commodification of accelerations for the Karp and Miller construction