Modeling multithreaded applications using Petri nets

DOI10.1023/A:1019917329895zbMath1083.68578OpenAlexW1542873808MaRDI QIDQ1871095

Krishna M. Kavi, Alireza Moshtaghi, Deng-Jyi Chen

Publication date: 6 May 2003

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019917329895

zbMATH Keywords

Petri netsdeadlocksrace conditionslost signalsPthreads

Mathematics Subject Classification ID

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

Related Items (2)

Concurrency bugs in multithreaded software: modeling and analysis using Petri nets ⋮ Small vertex cover makes Petri net coverability and boundedness easier

This page was built for publication: Modeling multithreaded applications using Petri nets