Reachability analysis of (timed) Petri nets using real arithmetic

DOI10.1007/3-540-48320-9_14MaRDI QIDQ4270057zbMATH OpenFDO

Authors Béatrice Bérard, Laurent Fribourg

Publication date 20 December 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48320-9_14

zbMATH Keywords

meta-transitionsPetri netsreachability

Mathematics Subject Classification ID

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

Recommendations

• Symbolic Reachability Analysis of Integer Timed Petri Nets
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Using forward reachability analysis for verification of timed Petri nets
• Analysis of reachability and prohibitibility of a class of coloured Petri nets with interval timed arcs
• scientific article; zbMATH DE number 1534591

Cited in

(9)

• Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
• Monotonic extensions of Petri nets: forward and backward search revisited
• scientific article; zbMATH DE number 6708300 (Why is no real title available?)
• Symbolic Reachability Analysis of Integer Timed Petri Nets
• Verification and parameter synthesis for real-time programs using refinement of trace abstraction
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Using forward reachability analysis for verification of timed Petri nets
• MCMT: a model checker modulo theories
• Automated polyhedral abstraction proving

Describes a project that uses

Uses Software

• Uppaal

This page was built for publication: Reachability analysis of (timed) Petri nets using real arithmetic

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