Abstract
We consider the problem of incremental cycle analysis for dataflow models in the Embedded Systems Modeling Language (ESMoL). This is an example of a syntactic property which does not lend itself to compositional analysis. We give a general form of a cycle enumeration algorithm that makes use of graph hierarchy to improve analysis efficiency. Our framework also stores simple connectivity information in the model to accelerate future cycle analyses when additional components are added or modifications are made. An extended version of this work gives a mapping from a term algebraic model of the ESMoL component model and logical dataflow sublanguages to the analysis framework, and an evaluation on a fixed-wing aircraft controller model[7]. Integrated cycle analysis aids well-formedness checking during model construction in the ESMoL tool suite.
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
Benveniste, A., Caspi, P., di Natale, M., Pinello, C., Sangiovanni-Vincentelli, A., Tripakis, S.: Loosely time-triggered architectures based on communication-by-sampling. In: EMSOFT 2007: Proc. of the 7th ACM & IEEE Intl. Conf. on Embedded Software, pp. 231–239. ACM, New York (2007)
Bruni, R., Gadducci, F., Lafuente, A.L.: An Algebra of Hierarchical Graphs and Its Application to Structural Encoding. Scientific Annals of Computer Science 20, 53–96 (2010)
Easwaran, A.: Advances in hierarchical real-time systems: Incrementality, optimality, and multiprocessor clustering. Ph.D. thesis, Univ. of Pennsylvania (2008)
Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77–84 (1975)
Lee, E.A., Messerschmitt, D.G.: Synchronous data flow. Proc. of the IEEE 75(9), 1235–1245 (1987)
Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 5(1), 90–99 (1976)
Porter, J., Balasubramanian, D., Hemingway, G., Sztipanovits, J.: Towards Incremental Cycle Analysis in ESMoL Distributed Control System Models (Extended Version) (April 2011), http://www.isis.vanderbilt.edu/sites/default/files/incr_cycle_analysis.pdf
Porter, J., Hemingway, G., Nine, H., vanBuskirk, C., Kottenstette, N., Karsai, G., Sztipanovits, J.: The ESMoL Language and Tools for High-Confidence Distributed Control Systems Design. Part 1: Language, Framework, and Analysis (September 2010), http://www.isis.vanderbilt.edu/sites/default/files/ESMoL_TR.pdf
Shin, I.: Compositional Framework for Real-Time Embedded Systems. Ph.D. thesis, Univ. of Pennsylvania, Philadelphia (2006)
Siek, J.G., Lee, L.Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Professional, Reading (2001)
The MathWorks, Inc.: Simulink/Stateflow Tools, http://www.mathworks.com
Tiernan, J.C.: An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 13, 722–726 (1970), http://doi.acm.org/10.1145/362814.362819
Tripakis, S., Bui, D., Geilen, M., Rodiers, B., Lee, E.A.: Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs. Tech. Rep. UCB/EECS-2010-52, Univ. of California, Berkeley (2010)
Zhou, Y., Lee, E.: Causality interfaces for actor networks. ACM Trans. on Emb. Computing Systems 7(3) (April 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porter, J., Balasubramanian, D., Hemingway, G., Sztipanovits, J. (2011). Towards Incremental Cycle Analysis in ESMoL Distributed Control System Models. In: Apel, S., Jackson, E. (eds) Software Composition. SC 2011. Lecture Notes in Computer Science, vol 6708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22045-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-22045-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22044-9
Online ISBN: 978-3-642-22045-6
eBook Packages: Computer ScienceComputer Science (R0)