Verifying Parallel Algorithms and Programs Using Coloured Petri Nets

DOI10.1007/978-3-642-35179-2_7zbMath1377.68141OpenAlexW28284498MaRDI QIDQ4909354

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

Mathematics Subject Classification ID

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

Related Items (1)

Equivalence checking of Petri net models of programs using static and dynamic cut-points

Uses Software

• BLAST
• SLAM
• SPIN
• Java PathFinder
• FeaVer

This page was built for publication: Verifying Parallel Algorithms and Programs Using Coloured Petri Nets