Equivalence checking of Petri net models of programs using static and dynamic cut-points
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 1049168 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3403724 (Why is no real title available?)
- scientific article; zbMATH DE number 3200078 (Why is no real title available?)
- A path construction algorithm for translation validation using PRES+ models
- An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
- Coloured Petri Nets
- Deriving bisimulation relations from path based equivalence checkers
- Embedded System Design
- Hardness of equivalence checking for composed finite-state systems
- Program correctness: on inductive assertion methods
- Validating High-Level Synthesis
- Verification of Petri nets with read arcs
- Verifying parallel algorithms and programs using coloured Petri nets
Cited in
(5)- scientific article; zbMATH DE number 3988724 (Why is no real title available?)
- A model reduction method for parallel software testing
- A path construction algorithm for translation validation using PRES+ models
- Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
- Translation validation of coloured Petri net models of programs on integers
This page was built for publication: Equivalence checking of Petri net models of programs using static and dynamic cut-points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415374)