Abstract
The notion of observable liveness was introduced in the literature for 1-safe Petri net systems in which transitions are either observable or unobservable by a user and, among the observable ones, some are controllable, in the sense that they correspond to interactions with the user and cannot autonomously occur. An observable transition is observably live if a user can, from any reachable marking, force it to occur infinitely often by using controllable transitions. Here, we introduce a weaker version of this notion by considering the capability of the user, by means of controllable transitions, to force the considered observable transition to fire infinitely often, starting from the initial marking instead of considering each reachable marking. The main result of this paper is a method for checking weak observable liveness in state machine decomposable 1-safe nets whose transitions are observable. The introduced method is based on infinite games that are played on finite graphs. We transform the problem of weak observable liveness into a game between a system and a user, and we prove that a transition is weakly observably live if and only if the user has a winning strategy for the game.
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
References
Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. Theoret. Comput. Sci. 55(1), 87–136 (1987)
Richard Büchi, J.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66–92 (1960)
Richard Büchi, J.: On a decision method in restricted second order arithmetic. In: Proceedings of the 1960 International Congress Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press, Stanford (1962)
Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Springer, New York (2006)
Desel, J., Kılınç, G.: Observable liveness. In: Moldt, D., Rölke, H. (eds.) International Workshop on Petri Nets and Software Engineering (PNSE 2014). CEUR Workshop Proceedings, Aachen, vol. 1160, pp. 143–163. CEUR-WS.org. (2014). http://ceur-ws.org/Vol-1160/
Desel, J., Kılınç, G.: Observable liveness of Petri nets. Acta Inf. 52(2–3), 153–174 (2015)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games: A Guide to Current Research. Springer, New York (2002)
Holloway, L.E., Krogh, B.H., Giua, A.: A survey of Petri net methods for controlled discrete event systems. Discrete Event Dyn. Syst. 7(2), 151–190 (1997)
Jurdzinski, M.: Deciding the winner in parity games is in UP \(\cap \) co-up. Inf. Process. Lett. 68(3), 119–124 (1998)
Jurdziński, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290–301. Springer, Heidelberg (2000). doi:10.1007/3-540-46541-3_24
Kılınç, G.: Formal Notions of Non-interference and Liveness for Distributed Systems. Ph.D thesis in computer science, Universitá Degli Studi di Milano-Bicocca, Dipartimento di Informatica, Sistemistica e Comunicazione (2016)
Martin, D.A.: Borel determinacy. Ann. Math. 102, 363–371 (1975)
McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65(2), 149–184 (1993)
Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the 4th Annual Symposium on Switching Circuit Theory and Logical Design, Chicago, Illinois, USA, pp. 3–16, 28–30 October 1963
Silva, M.: Half a century after Carl Adam Petri’s Ph.D. thesis: A perspective on the field. Ann. Rev. Control 37(2), 191–219 (2013)
Streett, R.S.: Propositional dynamic logic of looping and converse. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC 1981, pp. 375–383. ACM, New York, NY, USA (1981)
Thomas, W.: Automata on infinite objects. In: Van Leeuwen, J. (ed.) Formal Models and Semantics, Handbook of Theoretical Computer Science, pp. 133–191. Elsevier, Amsterdam (1990)
Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995). doi:10.1007/3-540-59042-0_57
Acknowledgements
This work is partially supported by MIUR.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bernardinello, L., Kılınç, G., Pomello, L. (2017). Weak Observable Liveness and Infinite Games on Finite Graphs. In: van der Aalst, W., Best, E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2017. Lecture Notes in Computer Science(), vol 10258. Springer, Cham. https://doi.org/10.1007/978-3-319-57861-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-57861-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57860-6
Online ISBN: 978-3-319-57861-3
eBook Packages: Computer ScienceComputer Science (R0)