Abstract
For modeling modern streaming-oriented applications, Process Networks (PNs) are used to describe systems with changing behavior, which must be mapped on a concurrent architecture to meet the performance and energy constraints of embedded devices. Finding an optimal mapping of Process Networks to the constrained architecture presumes that the behavior of the Process Network is statically known. In this paper we present a static analysis for synchronous PNs that extracts different run-time modes by using polyhedral abstraction. The result is a Mealy machine whose states describe different run-time modes and the edges among them represent transitions. This machine can be used to guide optimizing backend mappings from PNs to concurrent architectures.
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.
References
Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming 72(1-2), 3–21 (2008)
Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84–96. ACM, New York (1978)
Geilen, M., Basten, T.: Reactive process networks. In: Proceedings of the 4th ACM International Conference on Embedded Software, pp. 137–146. ACM, New York (2004)
Gheorghita, S.V., Palkovic, M., Hamers, J., Vandecappelle, A., Mamagkakis, S., Basten, T., Eeckhout, L., Corporaal, H., Catthoor, F., Vandeputte, F., Bosschere, K.D.: System-scenario-based design of dynamic embedded systems. ACM Transactions on Design Automation of Electronic Systems 14(1), 1–45 (2009)
Girault, A., Lee, B., Lee, E.: Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 18(6), 742–760 (1999)
Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11(2), 157–185 (1997)
IEEE Standard Association. IEEE Std. 1666-2005, Open SystemC language reference manual (2006), www.systemc.org
Kahn, G.: The semantics of simple language for parallel programming. In: IFIP Congress, pp. 471–475. North Holland Publishing Company, Stockholm (1974)
de Kock, E.A., Essink, G., Smits, W.J.M., van der Wolf, R., Brunei, J.-Y., Kruijtzer, W.M., Lieverse, P., Vissers, K.A.: YAPI: Application modeling for signal processing systems. In: 37th Design Automation Conference, Los Angeles, CA, pp. 402–405 (June 2000)
Theelen, B.D., Geilen, M., Basten, T., Voeten, J.P.M., Gheorghita, S.V., Stuijk, S.: A scenario-aware data flow model for combined long-run average and worst-case performance analysis. In: MEMOCODE 2006: Proceedings of the Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, Napa Valley, California, pp. 185–194 (July 2006)
Thiele, L., Stehl, K., Ziegenbein, D., Ernst, R., Teich, J.: Funstate - An internal design representation for codesign. In: ICCAD 1999: Proceedings of the 1999 IEEE/ACM International Conference on Computer-aided Design, pp. 558–565. IEEE Press, Piscataway (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beyer, M., Glesner, S. (2012). Static Analysis of Run-Time Modes in Synchronous Process Network. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2011. Lecture Notes in Computer Science, vol 7162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29709-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-29709-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29708-3
Online ISBN: 978-3-642-29709-0
eBook Packages: Computer ScienceComputer Science (R0)