Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance
- 1 November 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-6 (6) , 525-530
- https://doi.org/10.1109/TSE.1980.230802
Abstract
This paper presents a method for synthesizing or growing live and safe marked graph models of decision-free concurrent comutations. The approach is modular in the sense that subsystems r represented by arcs (and nodes) are added one by one without the need of redesigning the entire system. The foliowing properties of marked graph models can be prescribed in the synthesis: liveness (absence of deadlocks), safeness (absence of overflows), the number of reachability classes, the maximum resource (temporary storage) requirement, computation rate (performance), as well as the numbers of arcs and states.Keywords
This publication has 10 references indexed in Scilit:
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri NetsIEEE Transactions on Software Engineering, 1980
- Relevance of network theory to models of distributed/parallel processingJournal of the Franklin Institute, 1980
- Reduction and expansion of live and safe marked graphsIEEE Transactions on Circuits and Systems, 1980
- Special Feature: Putting Petri Nets to WorkComputer, 1979
- A Synthesis Rule for Concurrent SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Petri NetsACM Computing Surveys, 1977
- Circuit theoretic analysis and synthesis of marked graphsIEEE Transactions on Circuits and Systems, 1977
- A Methodology for the Design and Implementation of Communication ProtocolsIEEE Transactions on Communications, 1976
- Evaluation nets for computer system performance analysisPublished by Association for Computing Machinery (ACM) ,1972
- Marked directed graphsJournal of Computer and System Sciences, 1971