Skip to main content
SpringerLink
Log in

VeriSiMPL 2: An open-source software for the verification of max-plus-linear systems

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

This work presents a technique to generate finite abstractions of autonomous Max-Plus-Linear (MPL) systems, a class of discrete-event systems employed to characterize the dynamics of the timing related to the synchronization of successive events. Abstractions of MPL systems are derived as finite-state transition systems. A transition system is obtained first by partitioning the state space of the MPL system into finitely many regions and then by associating a unique state of the transition system to each partitioning region. Relations among the states of the transition system are then set up based on the underlying dynamical transitions between the corresponding partitioning regions of the MPL state space. In order to establish formal equivalences, the obtained finite abstractions are proven either to simulate or to bisimulate the original MPL system. The approach enables the study of general properties of the original MPL system formalized as logical specifications, by verifying them over the finite abstraction via model checking. The article presents a new, extended and improved implementation of a software tool (available online) for the discussed formal abstraction of MPL systems, and is tested on a numerical benchmark against a previous version.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. The matrices are (n+1)-dimensional rather than n-dimensional because we need to store x 0 as well.

  2. Notice that, the (i+1,j+1)-th element corresponds to x j −x i (not x i −x j ).

  3. The notation AP does not represent the multiplication of matrix A by matrix P.

References

  • Adzkiya D, Abate A (2013) VeriSiMPL: Verification via biSimulations of MPL models. In: Joshi K., Siegle M., Stoelinga M., D’Argenio P. (eds) Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST’13), Lecture Notes in Computer Science, vol. 8054, pp. 253–256 Springer, Heidelberg. sourceforge.net/projects/verisimpl/

  • Adzkiya D, De Schutter B, Abate A (2013) Finite abstractions of max-plus-linear systems. IEEE Trans Autom Control 58(12):3039–3053

    Article  MathSciNet  Google Scholar 

  • Adzkiya D, De Schutter B, Abate A (2014a) Backward reachability of autonomous max-plus-linear systems. In: Proceedings of the 12th International Workshop on Discrete Event Systems (WODES’14), 117–122. Cachan, FR

  • Adzkiya D, De Schutter B, Abate A (2014b) Tools and algorithms for the construction and analysis of systems (TACAS’14). In: Ábrahám E, Havelund K (eds) Forward reachability computation for autonomous max-plus-linear systems. Lecture notes in computer science, vol 8413. Springer, Heidelberg, pp 248– 262

  • Adzkiya D, De Schutter B, Abate A (2015) Computational techniques for reachability analysis of max-plus-linear systems. Automatica 53(0):293–302

    Article  MathSciNet  Google Scholar 

  • Alur R, Henzinger T, Lafferriere G, Pappas GJ (2000) Discrete abstractions of hybrid systems. Proc of the IEEE 88(7):971–984

    Article  Google Scholar 

  • Baccelli F, Cohen G, Olsder G, Quadrat JP (1992) Synchronization and Linearity, An Algebra for Discrete Event Systems. John Wiley and Sons. www.maxplus.org

  • Baier C, Katoen JP (2008) Principles of Model Checking. The MIT Press

  • Bellman R (1958) On a routing problem. Q Appl Math 16:87–90

    MATH  Google Scholar 

  • Bemporad A, Ferrari-Trecate G, Morari M (2000) Observability and controllability of piecewise affine and hybrid systems. IEEE Trans Autom Contro 45 (10):1864–1876

    Article  MathSciNet  MATH  Google Scholar 

  • Biere A, Cimatti A, Clarke E, Zhu Y (1999) Symbolic model checking without BDDs. In: Cleaveland W. (ed) Tools and Algorithms for the Construction and Analysis of Systems (TACAS’99), Lecture Notes in Computer Science, vol. 1579. Springer, Heidelberg, pp 193–207

  • Brackley CA, Broomhead DS, Romano MC, Thiel M (2012) A max-plus model of ribosome dynamics during mRNA translation. J Theor Biol 303(0):128–140

    Article  MathSciNet  Google Scholar 

  • Cimatti A, Clarke E, Giunchiglia E, Giunchiglia F, Pistore M, Roveri M, Sebastiani R, Tacchella A (2002) Computer Aided Verification (CAV’02), Lecture Notes in Computer Science, vol. 2404. In: Brinksma E., Larsen K. (eds) NuSMV 2: An opensource tool for symbolic model checking. Springer, Heidelberg, pp 359–364

  • Cohen G, Gaubert S, Quadrat JP (1999) Max-plus algebra and system theory: Where we are and where to go now. Annu Rev Control 23(0):207–219

    Article  Google Scholar 

  • Cuninghame-Green R (1979) Minimax algebra, lecture notes in economics and mathematical systems, vol 166. Springer-Verlag, Berlin

  • De Schutter B (2000) On the ultimate behavior of the sequence of consecutive powers of a matrix in the max-plus algebra. Linear Algebra Appl 307(1-3):103–117

    Article  MathSciNet  MATH  Google Scholar 

  • De Schutter B, van den Boom T (2001) Model predictive control for max-plus-linear discrete event systems. Automatica 37(7):1049–1056

    Article  MATH  Google Scholar 

  • Di Loreto M, Gaubert S, Katz R, Loiseau J (2010) Duality between invariant spaces for max-plus linear discrete event systems. SIAM J Control Optim 48 (8):5606–5628

    Article  MathSciNet  MATH  Google Scholar 

  • Dill D (1990) Timing assumptions and verification of finite-state concurrent systems. In: Sifakis J (ed) Automatic verification methods for finite state systems, lecture notes in computer science, vol. 407, chap. 17. Springer, Heidelberg, pp 197–212

  • van Eekelen J, Lefeber E, Rooda J (2006) Coupling event domain and time domain models of manufacturing systems. In: Proceedings of the 45th IEEE Conference on Decision and Control (CDC’06), pp. 6068–6073

  • Floyd RW (1962) Algorithm 97: Shortest path. Commun ACM 5(6):345

    Article  Google Scholar 

  • Heemels W, De Schutter B, Bemporad A (2001) Equivalence of hybrid dynamical models. Automatica 37(7):1085–1091

    Article  MATH  Google Scholar 

  • Heidergott B, Olsder G, van der Woude J (2006) Max plus at work–modeling and analysis of synchronized systems: a course on max-plus algebra and its applications. Princeton University Press

  • Holzmann G (2003) The SPIN model checker: primer and reference manual. Addison-Wesley

  • Katz RD (2007) Max-plus (A,B)-invariant spaces and control of timed discrete-event systems. IEEE Trans Autom Control 52 (2):229–241

    Article  Google Scholar 

  • Lafferriere G, Pappas G, Sastry S (2000) O-minimal hybrid systems. Math Control Sig Syst 13(1):1–21

    Article  MathSciNet  MATH  Google Scholar 

  • Leenaerts D, van Bokhoven W (1998) Piecewise linear modeling and analysis. Kluwer Academic Publishers, Boston

  • Maia C, Andrade C, Hardouin L (2011) On the control of max-plus linear system subject to state restriction. Automatica 47(5):988–992

    Article  MathSciNet  MATH  Google Scholar 

  • Milner R (1989) Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ

  • Pappas GJ (2003) Bisimilar linear systems. Automatica 39(12):2035–2047

    Article  MathSciNet  MATH  Google Scholar 

  • Roset B, Nijmeijer H, van Eekelen J, Lefeber E, Rooda J (2005) Event driven manufacturing systems as time domain control systems. In: Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC’05), 446–451

  • Shaffer C (2011) Data Structures and Algorithm Analysis in Java, Third Edition. Dover Publications

  • Sontag E (1981) Nonlinear regulation: The piecewise-linear approach. IEEE Trans Autom Control 26(2):346–358

    Article  MathSciNet  MATH  Google Scholar 

  • Wegener I (2000) Branching programs and binary decision diagrams - Theory and applications. SIAM monographs on discrete mathematics and applications

  • Yordanov B, Belta C (2010) Formal analysis of discrete-time piecewise affine systems. IEEE Trans Autom Control 55(12):2834–2840

    Article  MathSciNet  Google Scholar 

  • Yordanov B, Tu̇mová J, Černá I, Barnat J, Belta C (2013) Formal analysis of piecewise affine systems through formula-guided refinement. Automatica 49 (1):261–266

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Delft Center for Systems and Control, Delft University of Technology, Mekelweg 2, 2628, CD, Delft, The Netherlands

    Dieky Adzkiya

  2. Department of Mathematics, Institut Teknologi Sepuluh Nopember, Surabaya, 60111, Indonesia

    Dieky Adzkiya

  3. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK

    Yining Zhang & Alessandro Abate

Authors
  1. Dieky Adzkiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yining Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alessandro Abate
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dieky Adzkiya.

Additional information

This work has been supported by the European Commission via STREP project MoVeS 257005, Marie Curie grant MANTRAS 249295, and IAPP project AMBI 324432.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Adzkiya, D., Zhang, Y. & Abate, A. VeriSiMPL 2: An open-source software for the verification of max-plus-linear systems. Discrete Event Dyn Syst 26, 109–145 (2016). https://doi.org/10.1007/s10626-015-0218-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-015-0218-x

Keywords

Search

Navigation