Petri-net-based deadlock analysis of Process Algebra programs
- 31 October 1994
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 23 (1) , 55-89
- https://doi.org/10.1016/0167-6423(94)00011-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Using partial orders to improve automatic verification methodsPublished by American Mathematical Society (AMS) ,1991
- Detection of Ada static deadlocks using Petri net invariantsIEEE Transactions on Software Engineering, 1989
- A petri net framework for automated static analysis of Ada tasking behaviorJournal of Systems and Software, 1988
- A distributed operational semantics for CCS based on condition/event systemsActa Informatica, 1988
- A method for stepwise refinement and abstraction of Petri netsJournal of Computer and System Sciences, 1983
- A general-purpose algorithm for analyzing concurrent programsCommunications of the ACM, 1983
- Complexity of analyzing the synchronization structure of concurrent programsActa Informatica, 1983
- Additional methods for reduction and expansion of marked graphsIEEE Transactions on Circuits and Systems, 1981
- Reduction and expansion of live and safe marked graphsIEEE Transactions on Circuits and Systems, 1980
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980