Petri-net-based deadlock analysis of process algebra programs

DOI10.1016/0167-6423(94)00011-5MaRDI QIDQ1336776zbMATH OpenOpenAlexWikidataFDO

Authors V. Pereyra

Publication date 3 November 1994

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(94)00011-5

zbMATH Keywords

Petri netsprocess algebra programs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3967922
• scientific article; zbMATH DE number 3980501
• scientific article; zbMATH DE number 3926230
• A Petri Net Based Modeling of Active Objects and Futures
• Algebraic method of determining nonexistence of deadlock markings in Petri nets

Cited in

(5)

• scientific article; zbMATH DE number 1332966 (Why is no real title available?)
• Deadlock analysis of unbounded process networks
• scientific article; zbMATH DE number 1949607 (Why is no real title available?)
• Using heuristic search for finding deadlocks in concurrent systems
• scientific article; zbMATH DE number 4052746 (Why is no real title available?)

This page was built for publication: Petri-net-based deadlock analysis of process algebra programs

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