Verifying parallel algorithms and programs using coloured Petri nets

DOI10.1007/978-3-642-35179-2_7zbMATH Open1377.68141OpenAlexW28284498MaRDI QIDQ4909354FDOQ4909354

Michael Westergaard

Publication date: 13 March 2013

Published in: Transactions on Petri Nets and Other Models of Concurrency VI (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35179-2_7

Recommendations

• scientific article; zbMATH DE number 3988724
• A verifiable low-level concurrent programming model based on colored Petri nets
• scientific article; zbMATH DE number 1101604
• Verification of concurrent programs using Petri net unfoldings
• scientific article; zbMATH DE number 4172388

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Equivalence checking of Petri net models of programs using static and dynamic cut-points
• Tool-Based Verification of a Relational Vertex Coloring Program
• Verifying UCM specifications of distributed systems using colored Petri nets
• Title not available (Why is that?)

Uses Software

• BLAST
• SLAM
• SPIN
• Java PathFinder
• FeaVer

This page was built for publication: Verifying parallel algorithms and programs using coloured Petri nets

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