Abstract
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of so-called “Max-Plus” algebraic techniques to handle more realistic types of real-time systems. In particular, our framework encompasses graph or partial order automata, and more generally abstract models of real-time computations (including synchronous programs running over distributed architectures). To achieve this, we introduce a new dioid of partially commutative power series (transductions), whose elements encode timed behaviors. This formalism extends the traditional representation of timed event graphs by (rational) commutative transfer series with coefficients in the Max-Plus semiring. We sketch how this framework can be used to symbolically solve several problems of interest, related to real-time systems. Then we illustrate the use of this framework to encode a nontrivial mixed formalism of dataflow diagrams and automata.
This work is supported in part by Esprit LTR-SYRF project (EP 22703).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Baccelli, G. Cohen, G.J. Olsder, and J.P. Quadrat. Synchronization and Linearity. Wiley, 1992.
A. Benveniste, G. Berry. Real-Time systems design and programming. Another look at real-time programming, special section of Proc. of the IEEE, 9(9):1270–1282, sep 1991.
A. Benveniste, S. Gaubert, and C. Jard. Algebraic techniques for timed systems: monotone rational series and max-plus models Rapport de recherche, INRIA, July 1998. In preparation.
J. Berstel. Transductions and context-free languages, Teubner, 1979.
J. Berstel, C. Reutenauer. Les séries rationnelles et leurs langages, Etudes et recherches en informatique, Masson, Paris, 1984.
G. Cohen, P. Moller, J-P. Quadrat, and M. Viot. Algebraic Tools for the Performance Evaluation of Discrete Event Systems. Proc. of the IEEE, 1989.
S. Gaubert. Performance evaluation of (max,+) automata. IEEE Trans. on Automatic Control, 40(12), Dec 1995.
S. Gaubert. Resource optimization and (min,+) spectral theory. IEEE Trans. on Automatic Control, 40(11), Nov. 1995.
S. Gaubert and J. Mairesse. Task resource systems and (max,+) automata. In J. Gunawardena, editor, Idempotency, Publications of the Newton Institute. Cambridge University Press, 1996.
S. Gaubert, J. Mairesse. Modelling and Analysis of Timed Petri Nets using Heaps of Pieces, Submitted. Abridged version in the proc. of the ECC'97, Bruxelles, 1997.
S. Gaubert and Max Plus. Methods and applications of (max,+) linear algebra. Rapport de recherche 3088, INRIA, Jan 1997.
Alain Girault, Bilung Lee, and E. A. Lee, A Preliminary Study of Hierarchical Finite State Machines with Multiple Concurrency Models, Memorandum UCB/ERL M97/57, Electronics ResearchLaboratory, U. C. Berkeley, August 1997.
N. Halbwachs. Synchronous programming of reactive systems, Kluwer Academic Pub., 1993.
N. Halbwachs, Y.E. Proy and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2): 157–185, Aug 1997.
F. Maraninchi, Y. Rémond Mode-Automata: About Modes and States in Reactive Systems. Research Report, Verimag, 1997.
F. Baccelli, S. Foss and B. Gaujal, Free-choice Petri Nets — an algebraic approach, IEEE Trans. on Automatic Control, vol AC-41, No12, Dec 1996, 1751–1778.
J. Sifakis and S. Yovine, Compositional specification of timed systems. In 13th annual symposium on Theoretical Aspects of Computer Science, STACS'96, 347–359. LNCS 1046, Springer-Verlag, 1996.
S. Bornot and J. Sifakis, Relating time progress and deadlines in hybrid systems. In Int. Workshop HART'97, 286–300, Grenoble, France, March 1997. LNCS 1201, Springer-Verlag.
Handbook of TCS. Jan Van Leeuwen, editor. Volume B. Formal models and semantics. Chap. 3. Formal languages and power series, by A. Salomaa.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benveniste, A., Jard, C., Gaubert, S. (1998). Algebraic techniques for timed systems. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055636
Download citation
DOI: https://doi.org/10.1007/BFb0055636
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64896-3
Online ISBN: 978-3-540-68455-8
eBook Packages: Springer Book Archive