Abstract
This paper describes the development of finite abstractions of Max-Plus-Linear (MPL) systems using tropical operations. The idea of tropical abstraction is inspired by the fact that an MPL system is a discrete-event model updating its state with operations in the tropical algebra. The abstract model is a finite-state transition system: we show that the abstract states can be generated by operations on the tropical algebra, and that the generation of transitions can be established by tropical multiplications of matrices. The complexity of the algorithms based on tropical algebra is discussed and their performance is tested on a numerical benchmark against an existing alternative abstraction approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adzkiya, D.: Finite abstractions of max-plus-linear systems: theory and algorithms. Ph.D. thesis, Delft University of Technology (2014)
Adzkiya, D., Abate, A.: VeriSiMPL: verification via biSimulations of MPL models. In: Joshi, K., Siegle, M., Stoelinga, M., D’Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 274–277. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40196-1_22
Adzkiya, D., De Schutter, B., Abate, A.: Finite abstractions of max-plus-linear systems. IEEE Trans. Autom. Control 58(12), 3039–3053 (2013)
Adzkiya, D., De Schutter, B., Abate, A.: Computational techniques for reachability analysis of max-plus-linear systems. Automatica 53, 293–302 (2015)
Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. Wiley, Hoboken (1992)
Butkovič, P.: Max-algebra: the linear algebra of combinatorics? Linear Algebra Appl. 367, 313–335 (2003)
Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-52148-8_17
Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)
Heemels, W., De Schutter, B., Bemporad, A.: Equivalence of hybrid dynamical models. Automatica 37(7), 1085–1091 (2001)
Heidergott, B., Olsder, G.J., Van der Woude, J.: Max Plus at Work: Modeling and Analysis of Synchronized Systems: A Course on Max-Plus Algebra and Its Applications. Princeton University Press, Princeton (2014)
Itenberg, I., Mikhalkin, G., Shustin, E.I.: Tropical Algebraic Geometry, vol. 35. Springer, Basel (2009). https://doi.org/10.1007/978-3-0346-0048-4
Lu, Q., Madsen, M., Milata, M., Ravn, S., Fahrenberg, U., Larsen, K.G.: Reachability analysis for timed automata using max-plus algebra. J. Logic Algebraic Program. 81(3), 298–313 (2012)
Mufid, M.S., Adzkiya, D., Abate, A.: Tropical abstractions of max-plus-linear systems (2018). arXiv:1806.04604
Péron, M., Halbwachs, N.: An abstract domain extending difference-bound matrices with disequality constraints. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 268–282. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-69738-1_20
Pin, J.-E.: Tropical semirings. Idempotency, pp. 50–69 (1998)
Richards, A.: University of Oxford Advanced Research Computing (2015). Zenodo. https://doi.org/10.5281/zenodo.22558
Sergeev, S.: Max-plus definite matrix closures and their eigenspaces. Linear Algebra Appl. 421(2–3), 182–201 (2007)
Acknowledgements
The first author is supported by Indonesia Endowment Fund for Education (LPDP), while the third acknowledges the support of the Alan Turing Institute, London, UK.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Mufid, M.S., Adzkiya, D., Abate, A. (2018). Tropical Abstractions of Max-Plus Linear Systems. In: Jansen, D., Prabhakar, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2018. Lecture Notes in Computer Science(), vol 11022. Springer, Cham. https://doi.org/10.1007/978-3-030-00151-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-00151-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00150-6
Online ISBN: 978-3-030-00151-3
eBook Packages: Computer ScienceComputer Science (R0)