Skip to main content
SpringerLink
Log in

Discrete and continuous strategies for timed-arc Petri net games

  • SPIN 2016
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

Automatic strategy synthesis for a given control objective can be used to generate correct-by-construction controllers of real-time reactive systems. The existing symbolic approach for continuous timed game is a computationally hard task and current tools like UPPAAL TiGa often scale poorly with the model complexity. We suggest an explicit approach for strategy synthesis in the discrete-time setting and show that even for systems with closed guards, the existence of a safety discrete-time strategy does not imply the existence of a safety continuous-time strategy and vice versa. Nevertheless, we prove that the answers to the existence of discrete-time and continuous-time safety strategies coincide on a practically motivated subclass of urgent controllers that either react immediately after receiving an environmental input or wait with the decision until a next event is triggered by the environment. We then develop an on-the-fly synthesis algorithm for discrete timed-arc Petri net games. The algorithm is implemented in our tool TAPAAL, and based on the experimental evidence, we discuss the advantages of our approach compared to the symbolic continuous-time techniques.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. The set \({ Consume_{} }\) for the edge \(M\mathop {\rightarrow }\limits ^{d,t} M'\) was fixed in Definition 7, part b).

  2. UPPAAL TiGa only exists in a 32 bit version, but for none of the tests the 4GB limit was exceeded for UPPAAL TiGa.

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Andersen, M., Larsen, H., Srba, J., Sørensen, M., Taankvist, J.: Verification of liveness properties on closed timed-arc Petri nets. In: Mathematical and Engineering Methods in Computer Science: 8th International Doctoral Workshop, vol. 7721 of LNCS. Springer, (2013)

  3. Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime D.: Uppaal-tiga: Time for playing games! In: Computer Aided Verification: 19th International Conference, vol. 4590 of LNCS. Springer, Berlin (2007)

  4. Behrmann, G., David, A., Larsen, K., Hakansson, J., Petterson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: Third International Conference on Quantitative Evaluation of Systems, (2006)

  5. Berthomieu, B., Vernadat, F.: Time Petri nets analysis with TINA. In: Third International Conference on Quantitative Evaluation of Systems. IEEE Computer Society, (2006)

  6. Birch, S., Jacobsen, T., Jensen, J., Moesgaard, C., Samuelsen, N., Srba, J.: Interval abstraction refinement for model checking of timed-arc Petri nets. In: Formal Modeling and Analysis of Timed Systems: 12th International Conference, vol. 8711 of LNCS. Springer, Berlin (2014)

  7. Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: Protocol Specification, Testing and Verification X, Proceedings of the IFIP WG6.1 10th International Symposium on Protocol Specification. North-Holland, (1990)

  8. Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: a model-checking tool for real-time systems. In: Computer Aided Verification: 10th International Conference, vol. 1427 of LNCS, (1998)

  9. Bozga, M., Maler, O., Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In: Correct Hardware Design and Verification Methods: 10th IFIP WG10.5 Advanced Research Working Conference, vol. 1703 of LNCS. Springer, (1999)

  10. Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Concurrency Theory: 16th International Conference, vol. 3653 of LNCS. Springer, (2005)

  11. Church, A.: Application of recursive arithmetic to the problem of circuit synthesis. J. Symb Log, (1963)

  12. Church, A.: Logic, arithmetic, and automata. In: Proceedings of the International Congress Mathematicians (Stockholm, 1962). Institute Mittag-Leffler, (1963)

  13. Cong, J., Liu, B., Zhang, Z.: Scheduling with soft constraints. In: Proceedings of the 2009 International Conference on Computer-Aided Design, (Nov 2009)

  14. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  15. David, A., Jacobsen, L., Jacobsen, M., Jørgensen, K., Møller, M., Srba, J.: TAPAAL 2.0: integrated development environment for timed-arc Petri nets. In: Tools and Algorithms for the Construction and Analysis of Systems: 18th International Conference, vol. 7214 of LNCS. Springer, (2012)

  16. Dill, D.: Timing assumptions and verification of finite-state concurrent systems. In: Automatic Verification Methods for Finite State Systems: International Workshop, vol. 407 of LNCS. Springer, (1990)

  17. Finkbeiner, B.: Bounded synthesis for Petri games. In: Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, vol. 9360 of LNCS. Springer, (2015)

  18. Finkbeiner B., Olderog, E.: Petri games: synthesis of distributed systems with causal memory. In: Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, vol. 161 of EPTCS, (2014)

  19. Finkbeiner, B., Peter, H.: Template-based controller synthesis for timed systems. In: Tools and Algorithms for the Construction and Analysis of Systems: 18th International Conference, vol. 7214 of LNCS. Springer, (2012)

  20. Gardey, G., Lime, D., Magnin, M., Roux, O.: Romeo: a tool for analyzing time Petri nets. In: Computer Aided Verification: 17th International Conference, vol. 3576 of LNCS. Springer, (2005)

  21. Hanisch, H.: Analysis of place/transition nets with timed arcs and its application to batch process control. In: Application and Theory of Petri Nets 1993: 14th International Conference, vol. 691 of LNCS. Springer, (1993)

  22. Hoffman, A.J., Kruskal J.B.: Integral boundary points of convex polyhedra. In: H. Kuhn and A. Tucker, (eds). Linear Inequalities and Related Systems. (AM-38), pp. 223–246. Princeton University Press, Princeton (1957)

  23. Jacobs, S., Bloem, R., Brenguier, R., Könighofer, R., Pérez, G.A., Raskin, J., Ryzhyk, L., Sankur, O., Seidl, M., Tentrup, L., Walker, A.: The second reactive synthesis competition (SYNTCOMP) (2015). In: Proceedings of the Fourth Workshop on Synthesis (SYNT’15), vol. 202 of EPTCS, (2016)

  24. Jensen, P.G., Larsen, K.G., Srba, J.: Real-time strategy synthesis for timed-arc Petri net games via discretization. In: Proceedings of the 23rd International Symposium on Model Checking Software (SPIN’16), vol. 9641 of LNCS. Springer, (2016)

  25. Jensen, P.G., Larsen, K.G., Srba. J.: PTrie: Data structure for compressing and storing sets via prefix sharing. In: Proceedings of the 14th International Colloquium on Theoretical Aspects of Computing (ICTAC’17), vol. 10580 of LNCS. Springer, (2017) To appear

  26. Jensen, P.G., Larsen, K.G., Srba, J., Sørensen, M.G., Taankvist, J.H.: Memory efficient data structures for explicit verification of timed systems. In: NASA Formal Methods: 6th International Symposium, vol. 8430 of LNCS. Springer, (2014)

  27. Jørgensen, K., Larsen, K.G., Srba. J.: Time-darts: a data structure for verification of closed timed automata. In: Proceedings Seventh Conference on Systems Software Verification, vol. 102 of EPTCS. Open Publishing Association, (2012)

  28. Kempf, J.-F., Bozga, M., Maler, O.: As soon as probable: optimal scheduling under stochastic uncertainty. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 7795 of LNCS. Springer, (2013)

  29. Larsen, K.G., Wang, Y.: Time-abstracted bisimulation: implicit specifications and decidability. Inf. Comput. 134(2), 75–101 (1997)

  30. Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points (extended abstract). In: Automata, Languages and Programming: 25th International Colloquium, vol. 1443 of LNCS. Springer, (1998)

  31. Maler, O., Larsen, K.G., Krogh, B.H.: On zone-based analysis of duration probabilistic automata. In: Proceedings of the 12th International Workshop on Verification of Infinite-State Systems (INFINITY’10), vol.39 of EPTCS. Open Publishing Association, (2010)

  32. Mateo, J., Srba, J., Sørensen, M.: Soundness of timed-arc workflow nets in discrete and continuous-time semantics. Fundam. Inf. 140, 89–121 (2015)

  33. Peter, H.: Component-based abstraction refinement for timed controller synthesis. In : IEEE 2013 34th Real-Time Systems Symposium, IEEE Computer Society, IEEE (2009)

  34. Peter, H., Ehlers, R., Mattmüller, R.: Synthia: verification and synthesis for timed automata. In: Computer Aided Verification: 23rd International Conference, vol. 7214 of LNCS. Springer, (2011)

  35. Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: IFAC Proceedings, vol 31(18), pp. 447–452 (1998). http://www.sciencedirect.com/science/article/pii/S1474667017420325

  36. Raskin, J., Samuelides, M., Begin, L.: Petri games are monotone but difficult to decide. Technical report, Université Libre De Bruxelles, (2003)

  37. Ruiz, V., Gomez, F.C., deFrutosEscrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: Proceedings of The 8th International Workshop on Petri Nets and Performance Models, (1999)

  38. Zhou, Q., Wang, M., Dutta, S.: Generation of optimal control policy for flexible manufacturing cells: a Petri net approach. Int. J. Adv. Manuf. Technol. 10, 59–65 (1995)

    Article  Google Scholar 

Download references

Acknowledgements

The research leading to these results has received funding from the project DiCyPS funded by the Innovation Fund Denmark, the Sino Danish Research Center IDEA4CPS and the ERC Advanced Grant LASSO. The third author is partially affiliated with FI MU, Brno, Czech Republic.

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalborg University, Selma Lagerlöfs Vej 300, 9220, Aalborg East, Denmark

    Peter Gjøl Jensen, Kim Guldstrand Larsen & Jiří Srba

Authors
  1. Peter Gjøl Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kim Guldstrand Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Gjøl Jensen.

Additional information

Extended version of [24] with full proofs, improved implementation and updated experimential results.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jensen, P.G., Larsen, K.G. & Srba, J. Discrete and continuous strategies for timed-arc Petri net games. Int J Softw Tools Technol Transfer 20, 529–546 (2018). https://doi.org/10.1007/s10009-017-0473-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-017-0473-2

Keywords

Search

Navigation