
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, Alexandre Yakovlev, "Deriving Petri Nets from Finite Transition Systems," IEEE Transactions on Computers, vol. 47, no. 8, pp. 859882, August, 1998.  
BibTex  x  
@article{ 10.1109/12.707587, author = {Jordi Cortadella and Michael Kishinevsky and Luciano Lavagno and Alexandre Yakovlev}, title = {Deriving Petri Nets from Finite Transition Systems}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {8}, issn = {00189340}, year = {1998}, pages = {859882}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.707587}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Deriving Petri Nets from Finite Transition Systems IS  8 SN  00189340 SP859 EP882 EPD  859882 A1  Jordi Cortadella, A1  Michael Kishinevsky, A1  Luciano Lavagno, A1  Alexandre Yakovlev, PY  1998 KW  Petri Nets KW  transition systems KW  concurrent systems KW  asynchronous systems KW  synthesis. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a statebased representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for
[1] R. Alur and D. Dill, "Automata for Modeling RealTime Systems," Proc. 17th Int'l Colloq. Aut. Lang. Prog., 1990.
[2] A. Arnold, Finite Transition Systems. Prentice Hall, 1994.
[3] E. Badouel, L. Bernardinello, and P. Darondeau, "Polynomial Algorithms for the Synthesis of Bounded Nets," Lecture Notes in Computer Science, vol. 915, pp. 364383, 1995.
[4] E. Badouel and P. Darondeau, "Theory of Regions," Third Advance Course on Petri Nets. SpringerVerlag, 1998.
[5] L. Bernardinello, "Synthesis of Net Systems," Application and Theory of Petri Nets, Lecture Notes in Computer Science, vol. 691, pp. 89105. SpringerVerlag, 1993
[6] L. Bernardinello, G. De Michelis, K. Petruni, and S. Bigna, "On Synchronic Structure of Transition Systems," Proc. Int'l Workshop Structures in Concurrency Theory (STRICT), pp. 6984, May 1995.
[7] G. Berthelot, "Transformations and Decompositions of nets," Advances in Petri Nets '86, W. Reisig, W. Brauer, and G. Rozenberg, eds., Lecture Notes in Computer Science, vol. 254, pp. 359376. SpringerVerlag, Feb. 1987.
[8] K. Bilinski and E. Dagless, "High Level Synthesis of Synchronous Parallel Controllers," Proc. 17th Int'l Conf. Applications and Theory of Petri Nets, Lecture Notes in Computer Science, vol. 1,091, pp. 346365,Osaka, Japan, June 1996.
[9] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. SangiovanniVincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[10] R.E. Bryant, "Symbolic Boolean Manipulation with Ordered BinaryDecision Diagrams," ACM Computing Surveys, vol., 24 no. 3, pp. 293318, 1992.
[11] F. Di Cesare, G. Harhalakis, J.M. Proth, M. Silva, and F.B. Vernadat, Practice of Petri Nets in Manufacturing. Chapman&Hall, 1993.
[12] T.A. Chu, "Synthesis of SelfTimed VLSI Circuits from GraphTheoretic Specifications," PhD thesis, Massachusetts Inst. of Tech nology, June 1987.
[13] E.M. Clarke, D.E. Long, and K.L. McMillan, "A Language for Compositional Specification and Verification of Finite State Hardware Controllers," Proc. IEEE, vol. 79, no. 9, Sept. 1991.
[14] J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, "Complete State Encoding Based on the Theory of Regions," Proc. Int'l Symp. Advanced Research in Asynchronous Circuits and Systems, pp. 3647, Mar. 1996.
[15] J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, "Methodology and Tools for State Encoding in Asynchronous Circuit Synthesis," Proc. Design Automation Conf., pp. 6366, June 1996.
[16] J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, "Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers," IEICE Trans. Information and Systems, vol. E80D, no. 3, pp. 315325, Mar. 1997.
[17] J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev, "Deriving Petri Nets from Finite Transition Systems," Technical Report UPCDAC199619, Dept. of Computer Architecture, Universitat Politècnica de Catalunya, June 1996. ftp://ftp.ac.upc.es/pub/reports/DAC/1996 UPCDAC199619.ps.Z.
[18] O. Coudert, C. Berthet, and J.C. Madre, "Verification of Sequential Machines Using Boolean Functional Vectors," Proc. IFIP Int'l Workshop Applied Formal Methods for Correct VSLI Design, L. Claesen, ed., pp. 111128,Leuven, Belgium, Nov. 1989.
[19] G. de Jong and B. Lin, "A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules," Proc. Design Automation Conf., pp. 4955, Apr. 1994.
[20] J. Desel and J. Esparza, FreeChoice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge Univ. Press, 1995.
[21] J. Desel and W. Reisig, "The Synthesis Problem of Petri Nets," Acta Informatica, vol. 33, no. 4, pp. 297315, 1996.
[22] D.L. Dill, Trace Theory for Automatic Hierarchical Verification of SpeedIndependent Circuits.Cambridge, Mass.: MIT Press, 1988.
[23] D. Drusinsky, "Extended State Diagrams and Reactive Systems," Dr. Dobb's J., pp. 7280, 106107, Oct. 1994.
[24] A. Ehrenfeucht and G. Rozenberg, "Partial (Set) 2Structures, Parts I II," Acta Informatica, vol. 27, pp. 315368, 1990.
[25] J. Esparza and M. Nielsen, "Decidability Issues for Petri Nets," Petri Nets Newsletter, vol. 94, pp. 523, 1994.
[26] G. Hachtel and F. Somenzi, Logic Synthesis and Verification Algorithms. Kluwer Academic, 1996.
[27] M. Hack, "Analysis of Production Schemata by Petri Nets," TR 94, Project MAC, Massachusetts Inst. of Tech nology, 1972.
[28] C.A.R. Hoare,“Communicating sequential processes,” Comm. of the ACM, vol. 21, no. 8, pp. 666677, Aug. 1978.
[29] H. Hulgaard and S.M. Burns,“Bounded delay timing analysis of a class of CSP programs with choice,” Int’l Symp. Advanced Research in Asynchronous Circuits and Systems, Nov. 1994.
[30] R.M. Keller, "A Fundamental Theorem of Asynchronous Parallel Computation," Lecture Notes in Computer Science, vol. 24, pp. 103112, 1975.
[31] M. Kishinevsky, J. Cortadella, A. Kondratyev, L. Lavagno, and A. Yakovlev, "Synthesis of General Petri Nets," Technical Report 57, IEICE, Japan, May 1996.
[32] M. Kishinevsky, A. Kondratyev, A. Taubin, and V. Varshavsky, Concurrent Hardware: The Theory and Practice of SelfTimed Design.London: John Wiley and Sons, 1993.
[33] R.P. Kurshan, "Analysis of Discrete Event Coordination," Lecture Notes in Computer Science. SpringerVerlag, 1990.
[34] L. Lavagno and A. SangiovanniVincentelli, Algorithms for Synthesis and Testing of Asynchronous Circuits, Kluwer Academic Publishers, Boston, 1993.
[35] C.Y. Lee, "Representation of Switching Functions by Vinary Decision Programs," Bell System Technical J., vol. 38, pp. 985999, 1959.
[36] B. Lin and F. Somenzi, "Minimization of Symbolic Relations," Proc. IEEE Int'l Conf. ComputerAided Design, pp. 8891,Santa Clara, Calif., Nov. 1990.
[37] R. Milner, A Calculus of Communicating Systems. Berlin: Springer Verlag, vol. 92, 1980.
[38] R. Milner, Communication and Concurrency, PrenticeHall, Englewood Cliffs, N.J., 1989.
[39] D. Misunas, "Petri Nets and SpeedIndependent Design," Comm. ACM, pp. 474481, Aug. 1973.
[40] M. Mukund, "Petri Nets and Step Transition Systems," Int'l J. Foundations of Computer Science, vol. 3, no. 4, pp. 443478, 1992.
[41] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[42] M. Nielsen, G. Rozenberg, and P.S. Thiagarajan, "Elementary Transition Systems," Theoretical Computer Science, vol. 96, pp. 333, 1992.
[43] S.M. Nowick and D.L. Dill, "Automatic Synthesis of LocallyClocked Asynchronous State Machines," Proc. ICCAD, 1991.
[44] J. Oldfield and R. Dorf, FieldProgrammable Gate Arrays: Reconfigurable Logic for Rapid Prototyping and Implementation of Digital Systems. John Wiley and Sons, 1995.
[45] E. Paster and J. Cortadella, "Polynomial Algorithm for the Synthesis of HazardFree Circuits from STGs," Proc. Int'l Cconf. Computer Aided Design, pp. 250254, 1993.
[46] E. Pastor et al., "Petri Net Analysis Using Boolean Manipulation," Proc. Int'l Conf. Applications and Theory of Petri Nets, LNCS 815, SpringerVerlag, Berlin, 1994, pp. 416435.
[47] M. Peña and J. Cortadella, "Combining Process Algebras and Petri Nets for the Specification and Synthesis of Asynchronous Circuits," Proc. Int'l Symp. Advanced Research in Asynchronous Circuits and Systems, pp. 222232, Mar. 1996.
[48] C.A. Petri, "Kommunidation mit Automaten," PhD thesis, Technical Report Schriften des IIM Nr. 3, Institut für Instrumentalle Mathematik, Bonn, Germany, 1962.
[49] S.R. Petrick, "A Direct Determination of the Irredundant Forms of a Boolean Function from the Set of Prime Implicants," Technical Report AFCRCTR56110, Air Force Cambridge Research Center, Cambridge, Mass., Apr. 1956.
[50] M. Pezzè, R.N. Taylor, and M. Young, "Graph Models for Reachability Analysis of Concurrent Programs," ACM Trans. Software Eng. and Methodology, vol. 4, no. 2, pp. 171213, Apr. 1995.
[51] I. Reicher and M. Yoeli, "NetBased Modeling of Communicating Parallel Processes with Applications to VLSI Design," Technical Report 532, Technion, Haifa, Israel, 1988.
[52] T.G. Rokicki,“Representing and modeling digital circuits,” PhD thesis, Stanford Univ., 1993.
[53] L.Y. Rosenblum and A.V. Yakovlev, “Signal Graphs: From SelfTimed to Timed Ones,” Proc. Int’l Workshop Timed Petri Nets, IEEE CS Press, 1985, pp. 199207.
[54] M. Silva, Las Redes de Petri en la Automática y la Informática.Madrid, Spain: AC, 1985. (in Spanish)
[55] D.C. Tsichritzis and P.A. Bernstein, Operating Systems.London: Academic Press, 1974.
[56] K. van Berkel, Handshake Circuits: An Asynchronous Architecture for VLSI Programming, Int'l series parallel computation. Cambridge Univ. Press, 1993.
[57] G. Winskel, "Petri Nets, Algebras, Morphisms, and Compositionality," Information and Computation, pp. 197238, vol. 72, 1987.
[58] M. Zhou, F. DiCesare, and A. Desrochers, "A Hybrid Methodology for Synthesis of Petri Net Models for Manufacturing Systems," IEEE Trans. Robotics and Automation, vol. 8, no. 3, pp. 350361, June 1992.