Abstract
A compositional algebra, called mMCAN, for the execution time analysis of highlevel software processes is introduced. In mMCAN, processes can be concatenated, concurrently executed, and recursively invoked. We show that the set of execution times of an mMCAN is semilinear. We then propose and analyze an algorithm which calcuates the execution time sets of an mMCAN in semilinear forms. Finally, we consider several interesting variations of mMCAN whose execution time sets can be computed with algorithms.
Supported by National Science Council, Taiwan, ROC under grant NSC 86-2213-E-001-009
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
R. Alur, C. Courcoubetis, D.L. Dill. Model Checking for Real-Time Systems. 5th IEEE LICS, 1990.
R. Alur, T.A. Henzinger, P.-H. Ho. Automatic Symbolic Verification of Embedded Systems, in Proceedings of 1993 IEEE Real-Time System Symposium.
J.C.M. Baeten, J.A. Bergstra, J.W. Klop. Decidability of Bisimulation Equivalence for Process Generating Context-Free Languages. Tech. Rep. CS-R8632, 1987, CWI.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L.Dill, L.J. Hwang. Symbolic Model Checking: 1020 States and Beyond. 5th IEEE LICS, 1990.
A. Bouajjani, R. Echahed, P. Habermehl. On the Verification Problem of Nonregular Properties for Nonregular Processes. 10th IEEE LICS, 1995.
E. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM TOPLAS 8(2), 1986, pp. 244–263.
N. Chomsky. One Certain Formal Properties of Grammar. Information and Control, 2:2, 137–167.
S. Ginsburg, S.A. Greibach. Deterministic Context-Free Languages. Information and Control, 9:6, 563–582.
D. Harel. Statecharts: A Visual Formalism for Complex Systems.” The Weizmann Institute of Science Technical Report, Israel (July 1986). Also in Science of Programming 8, 1987.
T.A. Henzinger, Z. Manna, A. Pnueli. Temporal Proof Methodologies for Real-Time Systems. 18th ACM POPL, 1991.
T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, Symbolic Model Checking for Real-Time Systems, 7th IEEE LICS, 1992.
J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
F. Jahanian, A.K. Mok. Modechart: A Specification Language for Real-Time Systems.” to appear in IEEE Transactions on Software Engineering.
X. Nicollin, J. Sifakis, S. Yovine. From ATP to Timed Graphs and Hybrid Systems. In Real-Time: Theory in Practice, LNCS 600, Springer-Verlag, 1991.
R.J. Parikh. On Context-Free Languages. Journal of the Association for Computing Machinery, 4 (1966), 570–581.
F. Wang, A.K. Mok, E.A. Emerson. Real-Time Distributed System Specification and Verification in APTL. ACM TOSEM, Vol. 2, No. 4, Octobor 1993, pp. 346–378. Also in 14th ACM ICSE, 1992.
F. Wang. Timing Behavior Analysis for Real-Time Systems. 10th IEEE LICS, San Diego, 1995.
F. Wang, C.T. Lo. Procedure-Level Verification of Real-Time Concurrent Systems. in Proceedings of the 3rd FME, Oxford, Britain, March 1996; LNCS 1051, Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, F. (1997). High-level execution time analysis. In: Bertran, M., Rus, T. (eds) Transformation-Based Reactive Systems Development. ARTS 1997. Lecture Notes in Computer Science, vol 1231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63010-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-63010-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63010-4
Online ISBN: 978-3-540-69058-0
eBook Packages: Springer Book Archive