Program Models: Meaning and Proof
DOI:
https://doi.org/10.7146/dpb.v12i157.7431Abstract
When does one understand a program P? One reasonable answer is: when one has a conceptually clear model M such that any relevant question about P can be reformulated as a logically equivalent question about M. This paper argues for diagram models of parallel programs as a simple generalization of the familiar flowchart, graph and equation-set models of sequential programs. Diagram models of Petri nets were introduced by Hinderer.Downloads
Published
1983-01-01
How to Cite
Mayoh, B. H. (1983). Program Models: Meaning and Proof. DAIMI Report Series, 12(157). https://doi.org/10.7146/dpb.v12i157.7431
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.