Abstract
To model check concurrent systems, it is convenient to distinguish between the data flow and the control. Correctness is specified on the level of data flow whereas the system is configured on the level of control. Petri nets with transits and Flow-LTL are a corresponding formalism. In Flow-LTL, both the correctness of the data flow and assumptions on fairness and maximality for the control are expressed in linear time. So far, branching behavior cannot be specified for Petri nets with transits. In this paper, we introduce Flow-
to express the intended branching behavior of the data flow while maintaining LTL for fairness and maximality assumptions on the control. We encode physical access control with policy updates as Petri nets with transits and give standard requirements in Flow-
. For model checking, we reduce the model checking problem of Petri nets with transits against Flow-
via automata constructions to the model checking problem of Petri nets against LTL. Thereby, physical access control with policy updates under fairness assumptions for an unbounded number of people can be verified.
This work has been supported by the German Research Foundation (DFG) through Grant Petri Games (392735815) and through the Collaborative Research Center “Foundations of Perspicuous Software Systems” (TRR 248, 389792660), and by the European Research Council (ERC) through Grant OSARES (683300).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bauer, L., Cranor, L.F., Reeder, R.W., Reiter, M.K., Vaniea, K.: Real life challenges in access-control management. In: Proceedings of the CHI (2009)
Bauer, L., Garriss, S., Reiter, M.K.: Distributed proving in access-control systems. In: Proceedings of S&P (2005)
Bauer, L., Garriss, S., Reiter, M.K.: Efficient proving for practical distributed access-control systems. In: Biskup, J., López, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 19–37. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74835-9_3
Dax, C., Klaedtke, F.: Alternation elimination by complementation (extended abstract). In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS, vol. 5330, pp. 214–229. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89439-1_16
Engelfriet, J.: Branching processes of Petri nets. Acta Inf. 28(6), 575–591 (1991). https://doi.org/10.1007/BF01463946
Esparza, J., Heljanko, K.: Unfoldings - A Partial-Order Approach to Model Checking. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77426-6
Fernandez, E.B., Ballesteros, J., Desouza-Doucet, A.C., Larrondo-Petrie, M.M.: Security patterns for physical access control systems. In: Barker, S., Ahn, G.J. (eds.) DBSec 2007. LNCS, vol. 4602, pp. 259–274. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73538-0_19
Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.-R.: Model checking data flows in concurrent network updates. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 515–533. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31784-3_30
Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.-R.: AdamMC: a model checker for petri nets with transits against flow-LTL. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 64–76. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-53291-8_5
Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.: Model checking branching properties on Petri nets with transits (full version). arXiv preprint arXiv:2007.07235 (2020)
Fitzgerald, W.M., Turkmen, F., Foley, S.N., O’Sullivan, B.: Anomaly analysis for physical access control security configuration. In: Proceedings of CRiSIS (2012)
Frohardt, R., Chang, B.-Y.E., Sankaranarayanan, S.: Access nets: modeling access to physical spaces. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 184–198. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-18275-4_14
Geepalla, E., Bordbar, B., Du, X.: Spatio-temporal role based access control for physical access control systems. In: Proceedings of EST (2013)
Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, vol. 1. Springer, Heidelberg (1992). https://doi.org/10.1007/978-3-642-60794-3
Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312–360 (2000)
Miyano, S., Hayashi, T.: Alternating finite automata on omega-words. Theor. Comput. Sci. 32, 321–330 (1984)
Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985). https://doi.org/10.1007/978-3-642-69968-9
Tsankov, P., Dashti, M.T., Basin, D.A.: Access control synthesis for physical spaces. In: Proceedings of CSF (2016)
Welbourne, E., et al.: Building the internet of things using RFID: the RFID ecosystem experience. IEEE Internet Comput. 13(3), 48–55 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, ER. (2020). Model Checking Branching Properties on Petri Nets with Transits. In: Hung, D.V., Sokolsky, O. (eds) Automated Technology for Verification and Analysis. ATVA 2020. Lecture Notes in Computer Science(), vol 12302. Springer, Cham. https://doi.org/10.1007/978-3-030-59152-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-59152-6_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59151-9
Online ISBN: 978-3-030-59152-6
eBook Packages: Computer ScienceComputer Science (R0)