Concurrency bugs in multithreaded software: modeling and analysis using Petri nets

DOI10.1007/S10626-012-0139-XMaRDI QIDQ2393141zbMATH OpenOpenAlexFDO

Authors Hongwei Liao, Yin Wang, Hyoun Kyu Cho, Jason Stanley, Terence Kelly, Stéphane Lafortune, Scott A. Mahlke, Spyros Reveliotis

Publication date 7 August 2013

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10626-012-0139-x

zbMATH Keywords

reversibilitylinear separabilitymodelingPetri netsdeadlock analysislivenessconcurrent softwarediscrete-event system techniquesGadara netslock acquisitionshared-memory multithreaded programs

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65)

Recommendations

• Eliminating concurrency bugs in multithreaded software: an approach based on control of Petri nets
• Modeling multithreaded applications using Petri nets
• Publication:3033343
• Concurrency, Synchronization, and Conflicts in Petri Nets
• scientific article; zbMATH DE number 561087

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 5499378 (Why is no real title available?)
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
• Feedback control of Petri nets based on place invariants
• Generalized commutation matrix and its applications
• Integrating discrete controller synthesis into a reactive programming language compiler
• Introduction to Discrete Event Systems
• Modeling multithreaded applications using Petri nets
• Real-time management of resource allocation systems. A discrete event systems approach.
• Some model theory of sheaves of modules
• Supervisory control of concurrent systems. A Petri net structural approach.
• The theory of deadlock avoidance via discrete control

Cited in

(5)

• Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
• Modeling multithreaded applications using Petri nets
• Mixed integer programming-based liveness test for FMS with full routing flexibility
• A survey of siphons in Petri nets
• Eliminating concurrency bugs in multithreaded software: an approach based on control of Petri nets

Describes a project that uses

Uses Software

• CTrigger
• RacerX
• UMDES
• ESC/Java
• Gurobi

This page was built for publication: Concurrency bugs in multithreaded software: modeling and analysis using Petri nets

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