
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y.E. Papelis, T.L. Casavant, "Specification and analysis of parallel/distributed software and systems by Petri nets with transition enabling functions," IEEE Transactions on Software Engineering, vol. 18, no. 3, pp. 252261, March, 1992.  
BibTex  x  
@article{ 10.1109/32.126774, author = {Y.E. Papelis and T.L. Casavant}, title = {Specification and analysis of parallel/distributed software and systems by Petri nets with transition enabling functions}, journal ={IEEE Transactions on Software Engineering}, volume = {18}, number = {3}, issn = {00985589}, year = {1992}, pages = {252261}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.126774}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Specification and analysis of parallel/distributed software and systems by Petri nets with transition enabling functions IS  3 SN  00985589 SP252 EP261 EPD  252261 A1  Y.E. Papelis, A1  T.L. Casavant, PY  1992 KW  parallel/distributed software; Petri nets; transition enabling functions; TEFs; specification; decisionmaking activities; distributed computing systems; analytical properties; expressive power; PNs; TEFs; parallel/distributed software; formal specification; parallel programming; Petri nets VL  18 JA  IEEE Transactions on Software Engineering ER   
An approach for visually specifying parallel/distributed software using Petri nets (PNs) extend with transition enabling functions (TEFs) is investigated. The approach is demonstrated to be useful in the specification of decisionmaking activities that control distributed computing systems. PNs are employed because of their highly visual nature that can give insight into the nature of the controller of such a system and because of their analytical properties. In order to increase the expressive power of PNs, the extension of TEFs is used. The main focus is the specification and analysis of parallel/distributed software and systems. A key element of this approach is a set of rules derived to automatically transform such an extended net into a basic PN. Once the rules have been applied to transform the specification, analytical methods can be used to investigate characteristic properties of the system and validate correct operation.
[1] J. Agerwala, "A complete model for representing the coordination of asynchronous processes," Johns Hopkins Univ., Comp. Res. Rep. 32, 1974.
[2] T. Agerwala, "Putting Petri Nets to work,"IEEE Computer, vol. 12, pp. 8594, Dec. 1979.
[3] A. L. Ambler and M. M. Burnett, "Influence of visual technology on the evolution of language environments,"IEEE Computer, vol. 22, pp. 922, Oct. 1989.
[4] T. L. Casavant, W. Cheong, and A. Sajassi, "Complete specification of DDM mechanisms," Purdue Univ., Tech. Rep. TREE 8824, 1988.
[5] T. L. Casavant and J. G. Kuhl, "Analysis of three dynamic load balancing strategies with varying global information requirements," inProc. 7th IEEE Int. Conf. Distributed Comput. Syst., Sept. 1987, pp. 195192.
[6] T. L. Casavant and J. G. Kuhl, "Effects of response and stability on scheduling in distributed computing systems,"IEEE Trans. Software Eng., vol. 14, pp. 15781588, Nov. 1988.
[7] T. L. Casavant and J. G. Kuhl, "A communicating finite automata approach to modeling distributed computation and its application to distributed decisionmaking,"IEEE Trans. Computers, vol. 39, pp. 628639, May 1990.
[8] G. Ciardo, "Toward a definition of modeling power for stochastic Petri net models," inProc. Int. Workshop on Petri Nets and Performance Models, Aug. 1987, pp. 5462.
[9] J. B. Dugan and G. Ciardo, "Stochastic Petri net analysis of a replicated file system,"IEEE Trans. Software Eng., vol. 15, pp. 394401, Apr. 1989.
[10] I. R. Forman, "Petria UNIX tool for the analysis of Petri nets," inProc. Fall Joint Comput. Conf., Nov. 1986, pp. 10921098.
[11] H. J. Genrich and K. Lautenback, "Sinvariance in predicate transition nets,"Appl. Theory of Petri Nets, vol. 66, pp. 98111, Sept. 1982. (Proc. 3rd Eur. Workshop on Appl. and Theory of Petri Nets).
[12] H. J. Genrich, "Predicate/transition nets," inPetri Nets Central Models and Their Properties, W. Brauer, Ed. Berlin, Heidelberg, New York: SpringerVerlag, 1987, pp. 207247.
[13] K. Jensen, "Highlevel Petri nets,"Appl. Theory of Petri Nets, vol. 66, pp. 166180, Sept. 1982 (Proc. 3rd Eur. Workshop on Appl. and Theory of Petri Nets.)
[14] K. Jensen, "Computer tools for construction, modification and analysis of Petri nets," inAdvances in Petri Nets, Part II(Lecture Notes in Comput. Sci., vol. 255). New York: SpringerVerlag, 1986, pp. 419.
[15] N.G. Leveson and J.L. Stolzy, "Safety analysis using Petri nets,"IEEE Trans. Software Eng., vol. SE13, no. 3, pp. 386397, Mar. 1987.
[16] T. Lehret al., "Visualizing performance debugging,"IEEE Computer, vol. 22, pp. 3852, Oct. 1989.
[17] C. Lin and C. Marinescu, "On stochastic highlevel Petri nets," inProc. Int. Workshop on Petri Nets and Performance Models(Madison, WI), Aug. 1987.
[18] E. T. Morgan and R. R. Razouk, "Interactive statespace analysis of concurrent systems,"IEEE Trans. Software Eng., vol. SE13, pp. 10801091, Oct. 1987.
[19] T. Murata, "State equation, controllability, and maximal matchings of Petri nets,"IEEE Trans. Automat. Contr., vol. AC22, pp. 412415, June 1977.
[20] Y. E. Papelis and T. L. Casavant, "XPAT: an interactive graphical tool for synthesis of concurrent software using Petri nets," inProc. Int. Conf. Parallel Process., Aug. 1216, 1991, vol. 2, p. 292.
[21] J. L. Peterson,Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: PrenticeHall, 1981.
[22] W. Reisig, "Petri nets: An introduction," inEATCS Monographs on Theoretical Computer Science. New York: SpringerVerlag, 1985.
[23] G. Roman and K. C. Cox, "A declarative approach to visualizing concurrent computations,"IEEE Computer, vol. 22, pp. 2537, Oct. 1989.