A scheduling philosophy for multiprocessing systems
Communications of the ACM
On deadlock in computer systems
On deadlock in computer systems
Flow of control, resource allocation, and the proper termination of programs
Flow of control, resource allocation, and the proper termination of programs
An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis
IEEE Transactions on Parallel and Distributed Systems
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
A proposal for certain process management and intercommunication primitives
ACM SIGOPS Operating Systems Review
Concurrent software system design supported by SARA at the age of one
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Evaluation methods in SARA—the graph model simulator
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Modeling for synthesis - the gap between intent and behavior
Proceedings of the Symposium on Design Automation and Microprocessors
The graph model of behavior simulator
Proceedings of the Symposium on Design Automation and Microprocessors
Specialization of SARA for software synthesis
Proceedings of the Symposium on Design Automation and Microprocessors
Structured flowcharts for multiprocessing
Computer Languages
| Hi-index | 0.00 |
This paper presents new results from a study of flow-of-control in programs involving concurrent processes. Within the framework of flow-of-control, this paper: 1) defines a property of parallel program behavior called proper termination (PT); 2) shows that any properly terminating program containing a specification of the resources it requires will be free of deadlock; 3) identifies other important features of PT programs; and 4) presents an algorithm to rapidly decide PT for a given program. This work is presented in the context of the control-flow component of a complex bigraph (complex bi-logic directed graph) model of computation [1,10].