Skip to main content
Springer Nature Link
Log in

Computing a Parametric Reveals Relation For Bounded Equal-Conflict Petri Nets

  • Chapter
  • First Online:
Transactions on Petri Nets and Other Models of Concurrency XVII

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 14150))

  • 179 Accesses

Abstract

In a distributed system, in which an action can be either “hidden” or “observable”, an unwanted information flow might arise when occurrences of observable actions give information about occurrences of hidden actions. A collection of relations, i.e. reveals and its variants, is used to model such information flow among transitions of a Petri net. This paper recalls the reveals relations defined in [3], and proposes an algorithm to compute them on bounded equal-conflict PT systems, using a smaller structure than the one defined in [3].

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 38.51
Price includes VAT (France)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 47.46
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Model Checking Contest 2023. https://mcc.lip6.fr/2023/models.php. Accessed 28 Nov 2022

  2. SMART: Stochastic Model-checking Analyzer for Reliability and Timing. https://asminer.github.io/smart/. Accessed 28 Nov 2022

  3. Adobbati, F., Bernardinello, L., Kilinç Soylu, G., Pomello, L.: Information flow among transitions of bounded equal-conflict Petri nets. In: Köhler-Bussmeier, M., Moldt, D., Rölke, H. (eds.) Petri Nets and Software Engineering 2022, Bergen, Norway. CEUR Workshop Proceedings, vol. 3170, pp. 60–79. CEUR-WS.org (2022). http://ceur-ws.org/Vol-3170/paper4.pdf

  4. Adobbati, F., Bernardinello, L., Pomello, L.: A two-player asynchronous game on fully observable Petri nets. Trans. Petri Nets Other Model. Concurr. 15, 126–149 (2021). https://doi.org/10.1007/978-3-662-63079-2_6

    Article  MathSciNet  MATH  Google Scholar 

  5. Adobbati, F., Kılınç Soylu, G., Puerto Aubel, A.: A finite prefix for analyzing information flow among transitions of a free-choice net. IEEE Access 10, 38483–38501 (2022). https://doi.org/10.1109/ACCESS.2022.3165185

    Article  Google Scholar 

  6. Balaguer, S., Chatain, T., Haar, S.: Building tight occurrence nets from reveals relations. In: Caillaud, B., Carmona, J., Hiraishi, K. (eds.) Proceedings of the 11th ACSD, Newcastle Upon Tyne, UK, pp. 44–53. IEEE (2011). https://doi.org/10.1109/ACSD.2011.16

  7. Baldan, P., Carraro, A.: Non-interference by unfolding. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 190–209. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07734-5_11

    Chapter  Google Scholar 

  8. Basile, F., De Tommasi, G., Sterle, C.: Noninterference enforcement via supervisory control in bounded Petri nets. IEEE Trans. Automat. Contr. 66(8), 3653–3666 (2021). https://doi.org/10.1109/TAC.2020.3024274

    Article  MathSciNet  MATH  Google Scholar 

  9. Bernardinello, L., Kılınç, G., Pomello, L.: Weak observable liveness and infinite games on finite graphs. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 181–199. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57861-3_12

    Chapter  MATH  Google Scholar 

  10. Bernardinello, L., Kılınç, G., Pomello, L.: Non-interference notions based on reveals and excludes relations for Petri nets. Trans. Petri Nets Other Model. Concurr. 11, 49–70 (2016). https://doi.org/10.1007/978-3-662-53401-4_3

    Article  MathSciNet  MATH  Google Scholar 

  11. Best, E., Darondeau, P., Gorrieri, R.: On the decidability of non interference over unbounded Petri nets. In: Chatzikokolakis, K., Cortier, V. (eds.) Proceedings of the 8th SecCo, Paris, France, EPTCS, vol. 51, pp. 16–33 (2010). https://doi.org/10.4204/EPTCS.51.2

  12. Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. Theor. Comput. Sci. 55(1), 87–136 (1987). https://doi.org/10.1016/0304-3975(87)90090-9

    Article  MathSciNet  MATH  Google Scholar 

  13. Boudol, G., Castellani, I.: Noninterference for concurrent programs and thread systems. Theor. Comput. Sci. 281(1–2), 109–130 (2002). https://doi.org/10.1016/S0304-3975(02)00010-5

    Article  MathSciNet  MATH  Google Scholar 

  14. Busi, N., Gorrieri, R.: A survey on non-interference with Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 328–344. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27755-2_8

    Chapter  MATH  Google Scholar 

  15. Busi, N., Gorrieri, R.: Structural non-interference in elementary and trace nets. Math. Struct. Comput. Sci. 19(6), 1065–1090 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (1995). https://doi.org/10.1017/CBO9780511526558

  17. Engelfriet, J.: Branching processes of Petri nets. Acta Inf. 28, 575–591 (1991). https://doi.org/10.1007/BF01463946

  18. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Formal Methods Syst. Des. 20, 285–310 (2002). https://doi.org/10.1023/A:1014746130920

    Article  MATH  Google Scholar 

  19. Fahland, D., et al.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 278–293. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03848-8_19

    Chapter  Google Scholar 

  20. Focardi, R., Gorrieri, R.: A taxonomy of security properties for process algebras. J. Comput. Secur. 3(1), 5–34 (1995)

    Article  Google Scholar 

  21. Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 11–20 (1982)

    Google Scholar 

  22. Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inf. Control 57(2), 125–147 (1983). https://doi.org/10.1016/S0019-9958(83)80040-0

    Article  MATH  Google Scholar 

  23. Haar, S.: Unfold and cover: qualitative diagnosability for Petri nets. In: Proceedings of the 46th IEEE Conference on Decision Control (2007)

    Google Scholar 

  24. Haar, S., Rodríguez, C., Schwoon, S.: Reveal your faults: it’s only fair! In: Proceedings of the 13th ACSD, Barcelona, Spain, pp. 120–129 (2013)

    Google Scholar 

  25. Janicki, R., Lauer, P.E., Koutny, M., Devillers, R.: Concurrent and maximally concurrent evolution of nonsequential systems. Theor. Comput. Sci. 43, 213–238 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kılınç, G.: Formal notions of non-interference and liveness for distributed systems. Ph.D. thesis, Univ. Milano-Bicocca, DISCo, Milano, Italy (2016)

    Google Scholar 

  27. Mantel, H.: A uniform framework for the formal specification and verification of information flow security. Ph.D. thesis, Saarland University, Saarbrücken, Germany (2003). http://scidok.sulb.uni-saarland.de/volltexte/2004/202/index.html

  28. Mantel, H.: Information flow and noninterference. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, 2nd edn, pp. 605–607. Springer, Heidelberg (2011). https://doi.org/10.1007/978-1-4419-5906-5_874

  29. McCullough, D.: Specifications for multi-level security and a hook-up. In: Proceedings of the IEEE Symposium on Security and Privacy, p. 161 (1987). https://doi.org/10.1109/SP.1987.10009

  30. McLean, J.: A general theory of composition for a class of “possibilistic’’ properties. IEEE Trans. Software Eng. 22(1), 53–67 (1996). https://doi.org/10.1109/32.481534

    Article  Google Scholar 

  31. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989). https://doi.org/10.1109/5.24143

    Article  Google Scholar 

  32. Smith, E.: On the border of causality: contact and confusion. Theor. Comput. Sci. 153(1), 245–270 (1996). https://doi.org/10.1016/0304-3975(95)00123-9

    Article  MathSciNet  MATH  Google Scholar 

  33. Sutherland, D.: A model of information. In: Proceedings of the 9th National Computer Security Conference, vol. 247, pp. 175–183 (1986)

    Google Scholar 

  34. Teruel, E., Silva, M.: Liveness and home states in equal conflict systems. In: Ajmone Marsan, M. (ed.) Application and Theory of Petri Nets 1993. LNCS, vol. 691, pp. 415–432. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-56863-8_59

    Chapter  Google Scholar 

  35. Thiagarajan, P.S.: Elementary net systems. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986 Part I. LNCS, vol. 254, pp. 26–59. Springer, Heidelberg (1986). https://doi.org/10.1007/BFb0046835

    Chapter  Google Scholar 

  36. Weber, M., Kindler, E.: The Petri net markup language. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 124–144. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40022-6_7

    Chapter  MATH  Google Scholar 

Download references

Acknowledgements

The authors thank the reviewers for their precious comments. This work is partially supported by the Italian MUR.

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, viale Sarca 336 U14, Milano, Italy

    Federica Adobbati, Luca Bernardinello & Lucia Pomello

  2. Department of Computing Engineering, Izmir Institute of Technology, Gülbahçe, Urla, İzmir, Turkey

    Görkem Kılınç Soylu

  3. National Institute of Oceanography and Applied Geophysics - OGS, Trieste, Italy

    Federica Adobbati

Authors
  1. Federica Adobbati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Bernardinello
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Görkem Kılınç Soylu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lucia Pomello
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luca Bernardinello .

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcastle University, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Fakultät Zentralbereich, FernUniversität in Hagen, Hagen, Nordrhein-Westfalen, Germany

    Robin Bergenthum

  3. Dept of Computer Science, Iowa State University, Ames, IA, USA

    Gianfranco Ciardo

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer-Verlag GmbH, DE, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Adobbati, F., Bernardinello, L., Kılınç Soylu, G., Pomello, L. (2024). Computing a Parametric Reveals Relation For Bounded Equal-Conflict Petri Nets. In: Koutny, M., Bergenthum, R., Ciardo, G. (eds) Transactions on Petri Nets and Other Models of Concurrency XVII. Lecture Notes in Computer Science(), vol 14150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-68191-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-68191-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-68190-9

  • Online ISBN: 978-3-662-68191-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation