skip to main content
10.1145/1140389.1140400acmconferencesArticle/Chapter ViewAbstractPublication PagesscopesConference Proceedingsconference-collections
Article

MTP: a Petri net-based framework for the analysis and transformation of SystemC designs

Published: 29 September 2005 Publication History

Abstract

Shrinking time-to-market requires faster traversals of the design space of current complex SoC and embedded systems designs just as their complexity increases. To facilitate that designers are increasingly moving their exploration methodologies from RTL to system level. This, coupled with the need for a tighter integration between hardware and software earlier in the design cycle, has lead to emergence of mixed-level methodologies, such as SystemC, that allow for easier hardware/software codesign. In this paper, we describe a framework for the development of transformations aimed at restructuring both RTL and system-level SystemC models. We have chosen Petri nets, a well known mathematical model for concurrent systems, as our underlying formal representation. By balancing their expressive power and theoretical results transformations aimed at improving a wide range of metrics can be developed. To that effect we present the design and implementation of a semantics preserving reduction-based transformation that we have developed in previous work. Our experiments show that the resulting transformed SystemC models have indeed improved simulation performance over the original ones which often translates into designers being able to cover larger areas of the design space in the same amount of time.

References

[1]
E. Best, "Structure Theory of Petri Nets: the Free Choice Hiatus", Advances in Petri Nets, 1986, pages 168--205.]]
[2]
G. von Bochmann, R. Gotzhein, "A Petri net reduction algorithm for protocol analysis", Proceedings of the ACM SIGCOMM conference on Communications Architectures and Protocols, 1986, pages 157--166.]]
[3]
J. Cortadella, et al., "Task generation and compile-time scheduling for mixed data-control embedded software", Design Automation Conference, 2000.]]
[4]
J. Desel, J. Esparza, Free-choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, Volume 40, Cambridge University Press, 1995.]]
[5]
Edison Design Group's C++ Front End, http://www.edg.com/.]]
[6]
J. Esparza, "Reduction and Synthesis of Live and Bounded Free Choice Petri Nets", Information and Computation, 1991.]]
[7]
K. Jensen, "Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use", Springer, 1995.]]
[8]
T. Murata, "Petri nets: Properties, Analysis and Applications", Proceedings of IEEE, 77(4), 1989, pages 541--580.]]
[9]
B. Lin, "Software Synthesis of Process Based Concurrent Programs", In Proceedings of the 35th Design Automation Conference, 1998.]]
[10]
C. A. Petri, "Communications with Automata", Griffiths Air Force Base Technical Report RADC-TR-65-377, 1966.]]
[11]
OpenCores.org, http://www.opencores.org/.]]
[12]
Open SystemC Initiative, http://www.systemc.org/.]]
[13]
N. Savoiu, S. Shukla, R. Gupta, "Improving SystemC Simulation Through Petri Net Reductions", ACM-IEEE International Conference on Formal Methods and Models for Codesign, July 2005.]]
[14]
M. Sgroi, L. Lavagno, Y. Watanabe, A. Sangiovanni-Vincentelli, "Quasi-static Scheduling of Embedded Software Using Equal Conflict Nets", International Conference on Application and Theory of Petri Nets, 1999.]]
[15]
S. Shatz, S. Tu, T. Murata, S. Duri, "An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis", IEEE Transactions on Parallel and Distributed Systems, December 1996, Vol. 7, No. 12, pages 1307--1322.]]
[16]
SpecC Technology Open Consortium, http://www.specc.org/.]]
[17]
SystemVerilog, http://www.systemverilog.org/.]]
[18]
J. Wang, "Timed Petri Nets: Theory and Application", Kluwer International Series on Discrete Event Dynamic Systems, 1998.]]

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SCOPES '05: Proceedings of the 2005 workshop on Software and compilers for embedded systems
September 2005
132 pages
ISBN:1595932070
DOI:10.1145/1140389
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 September 2005

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 265
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media