Petri-net-based deadlock analysis of process algebra programs

DOI10.1016/0167-6423(94)00011-5zbMath0821.68090OpenAlexW1977895109WikidataQ114851996 ScholiaQ114851996MaRDI QIDQ1336776

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)

Related Items (1)

Using heuristic search for finding deadlocks in concurrent systems

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