Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings

Formal Methods in System Design

Volumn 12, Issue 1, 1998, Pages 5-38

  Kondratyev, Alex ^a   Kishinevsky, Michael ^a   Taubin, Alexander ^a   Ten, Sergei ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

Asynchronous design; Ordering relations; Petri net; Speed independence; Unfolding

Indexed keywords

DECISION THEORY; EQUIVALENT CIRCUITS; PARALLEL ALGORITHMS; SYSTEMS ANALYSIS;

ASYNCHRONOUS DESIGN; ORDERING RELATIONS; SIGNAL TRANSITION GRAPH; SPEED INDEPENDENCE;

PETRI NETS;

EID: 0031700719     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008669013857     Document Type: Article

References (27)

1. T.-A. Chu, "Synthesis of Self-timed VLSI Circuits from Graph-theoretic Specifications," PhD thesis, MIT, June 1987.
2. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev, "Synthesizing Petri nets from state-based models," Proceedings of the International Conference on Computer-Aided Design, November 1995.
3. J. Esparza, "Model checking using net unfoldings," In M.-C. Gaudel and J.-P. Jouannaud, editors, TAPSOFT'93: Theory and Practice of Software Development. 4th Int. Joint Conference CAAP/FASE, Lecture Notes in Computer Science 668, Springer-Verlag, 1993, pp. 613-628.
4. T. Esparza, S. Romer, and W. Vogler, "An improvement of mcmillan's unfolding algorithm," Technical Report TUM: 19599, Technische Universitat Munchen, August 1995.
5. P. Godefroid, "Using partial orders to improve automatic verification methods," In E.M Clarke and R.P. Kurshan, editors, Proc. International Workshop on Computer Aided Verification, DIMACS Series in Discrete Mathematica and Theoretical Computer Science, 1991, pp. 321-340.
6. M. A. Kishinevsky, A. Y. Kondratyev, A. R. Taubin, and V. I. Varshavsky, Concurrent Hardware. The Theory and Practice of Self-Timed Design, John Wiley and Sons Ltd., 1994.
7. Michael Kishinevsky and Jørgen Staunstrup, "Characterizing speed-independence of high-level designs," In Proceedings of the Symposium on Advanced Reserch in Asynchronous Cirsuits and Systems, Utah, USA, November 1994, pages 44-53.
8. A. Kondratyev, J. Cortadella, M. Kishinevsky, E. Pastor, O. Roig, and A. Yakovlev, "Checking Signal Transition Graph implementability by symbolic BDD traversal," In Proceedings of the European Design and Test Conference (ED&TC), Paris, France, March 1995, pp. 325-332
9. A. Kondratyev, M. Kishinevsky, A. Taubin, and S. Ten, "Analysis of petri nets by ordering relations in reduced unfoldings," Technical Report TR:95-2-002, The University of Aizu, June 1995.
10. A. Kondratyev and A. Taubin, "Verification of speed-independent circuits by STG unfoldings," In Proceedings of the Symposium on Advanced Reserch in Asynchronous Cirsuits and Systems, Utah, USA, November 1994, pp. 64-75.
11. L. Lavagno and A. Sangiovanni-Vincentelli, Algorithms for synthesis and testing of asynchronous circuits, Kluwer Academic Publishers, Boston/Dordrecht/London, 1993.
12. Luciano Lavagno, "Set of input-choice benchmarks," In Private Communication, 1994.
13. K. McMillan, "A technique of state space search based on unfolding," Formal Methods in System Design, 6:45-65, 1995.
14. T. H.-Y. Meng, Synchronization Design for Digital Systems. Kluwer Academic Publishers, Boston/Dordrecht/London,1991, contributions by David Messerschmitt,Steven Nowick, and David Dill.
15. D. E. Muller, "Asynchronous logics and application to information processing," In Proc. Symp. on Application of Switching Theory in Space Technology, Stanford University Press, 1963, pp. 289-297.
16. D. E. Muller and W. C. Bartky, "A theory of asynchronous circuits," In Annals of Computing Laboratory of Harvard University, 1959, pp. 204-243.
17. T. Murata, "Petri nets: Properties, analysis and applications," Proceedings of IEEE, 77:541-580, 1989.
18. M. Nielsen, G. Plotkin, and G. Winskel, "Events structures and domains," Theoretical Computer Science, 13:85-108, 1980.
19. S. M. Nowick and D. L. Dill, "Automatic synthesis of locally-clocked asynchronous state machines," In Proceedings of the International Conference on Computer-Aided Design, November 1991.
20. E. Pastor, O. Roig, J. Cortadella, and R. Badia, "Petri net analysis using boolean manipulation," In 15th International Conference on Application and Theory of Petri Nets, Zaragoza, Spain, June 1994, pp. 416-435.
21. S. Patil and J. Dennis, "The description and realization of digital systems," In Proceedings of the IEEE COMPCON, New York, 1972, pp. 223-226.
22. L. Pomello, G. Rozenberg, and C. Simone, "A survey of equivalence notions for net based systems," Lecture Notes in Computer Science, 609:410-472, 1993.
23. A. Semenov and A. Yakovlev, "Event-based framework for verifying high-level models of asynchronous circuits," Technical Report TR No.487, Computing Science, University of Newcastle upon Tyne, June 1994.
24. E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli, "SIS: A system for sequential circuit synthesis," Technical Report UCB/ERL M92/41, U.C. Berkeley, May 1992.
25. A. Valmari, "State of the art report: Stubborn sets," Petri Nets Newsletter, 46:6-14, 1994.
26. P. Vanbekbergen, F. Catthoor, G. Goossens, and H. De Man," Optimized synthesis of asynchronous control circuits from graph-theoretic specifications," IEEE Transactions on Computer-Aided Design, November 1992.
27. A. Yakovlev, M. Kishinevsky, A. Kondratyev, and L. Lavagno, "OR causality: modelling and hardware implementation," In Proceedings of the 15th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science 815, Zaragosa, Spain, Springer-Verlag, June 1994, pp. 568-587.