This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance
November 1980 (vol. 6 no. 6)
pp. 525-530
T. Murata, Department of Information Engineering, University of Illinois
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.
Index Terms:
prescribed perfornance, Absence of overflows, deadlock-freeness, decision-free concurrent systems, marked graphs, maximum resources, modular synthesis, parallel computation model
Citation:
T. Murata, "Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance," IEEE Transactions on Software Engineering, vol. 6, no. 6, pp. 525-530, Nov. 1980, doi:10.1109/TSE.1980.230802
Usage of this product signifies your acceptance of the Terms of Use.