Abstract
For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition.
The experimental results show significant improvement in terms of runtime compared with other existing methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties. LNCS, vol. 254, pp. 359–376. Springer, Heidelberg (1987)
Berkel, K.v.: Handshake Circuits: an Asynchronous Architecture for VLSI Programming. International Series on Parallel Computation, vol. 5 (1993)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35-8, 677–691 (1986)
Carmona, J.: Structural Methods for the Synthesis of Well-Formed Concurrent Specifications. PhD thesis, Univ. Politècnica de Catalunya (2003)
Carmona, J., Cortadella, J.: ILP models for the synthesis of asynchronous control circuits. In: Proc. of the IEEE/ACM International Conference on Computer Aided Design, pp. 818–825 (2003)
Carmona, J., Cortadella, J.: State encoding of large asynchronous controllers. In: DAC 2006, pp. 939–944 (2006)
Chu, T.-A.: Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. PhD thesis, MIT (1987)
Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: PETRIFY: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. IEICE Trans. Information and Systems E80-D, 3, 315–325 (1997)
Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Logic Synthesis of Asynchronous Controllers and Interfaces. Springer, Heidelberg (2002)
Edwards, D., Bardsley, A.: BALSA: an Asynchronous Hardware Synthesis Language. The Computer Journal 45(1), 12–18 (2002)
Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Formal Methods in System Design 20(3), 285–310 (2002)
International technology roadmap for semiconductors: Design (2005) URL: www.itrs.net/Links/2005ITRS/Design2005.pdf
Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD thesis, School of Computing Science, Newcastle University (2003)
Khomenko, V., Koutny, M.: Towards an efficient algorithm for unfolding Petri nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, Springer, Heidelberg (2001)
Khomenko, V., Koutny, M., Yakovlev, A.: Detecting state coding conflicts in STG unfoldings using SAT. Fundamenta Informaticae 62(2), 1–21 (2004)
Khomenko, V., Koutny, M., Yakovlev, A.: Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT. Fundamenta Informaticae 70(1–2), 49–73 (2006)
Khomenko, V., Schaefer, M.: Combining decomposition and unfolding for STG synthesis. Technical Report 2006-01, University of Augsburg (2006) URL: http://www.Informatik.Uni-Augsburg.DE/skripts/techreports/
Madalinski, A., Bystrov, A., Khomenko, V., Yakovlev, A.: Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design. IEE Proceedings: Computers and Digital Techniques 150(5), 285–293 (2003)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proc. of the IEEE 77(4), 541–580 (1989)
Semenov, A.: Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfolding. PhD thesis, Newcastle University (1997)
Schaefer, M., Vogler, W.: Component refinement and CSC solving for STG decomposition. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 348–363. Springer, Heidelberg (2005)
Schaefer, M., Vogler, W., Jančar, P.: Determinate STG decomposition of marked graphs. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 365–384. Springer, Heidelberg (2005)
Schaefer, M., Vogler, W., Wollowski, R., Khomenko, V.: Strategies for optimised STG decomposition. In: Proc. of ACSD (2006)
Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Vogler, W., Kangsah, B.: Improved decomposition of signal transition graphs. In: ACSD 2005, pp. 244–253 (2005)
Vogler, W., Wollowski, R.: Decomposition in asynchronous circuit design. In: Cortadella, J., Yakovlev, A.V., Rozenberg, G. (eds.) Concurrency and Hardware Design. LNCS, vol. 2549, pp. 152–190. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Khomenko, V., Schaefer, M. (2007). Combining Decomposition and Unfolding for STG Synthesis. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-73094-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73093-4
Online ISBN: 978-3-540-73094-1
eBook Packages: Computer ScienceComputer Science (R0)