Document Open Access Logo

Hyper Partial Order Logic

Authors Béatrice Bérard, Stefan Haar, Loic Hélouët

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2018.20.pdf
  • Filesize: 0.51 MB
  • 21 pages

Document Identifiers

Author Details

Béatrice Bérard
  • Sorbonne Université, CNRS, Laboratoire d'Informatique de Paris 6, LIP6, F-75005 Paris, France
Stefan Haar
  • INRIA and LSV, ENS Paris-Saclay and CNRS, Université Paris-Saclay, France
Loic Hélouët
  • Université de Rennes, Inria, CNRS, IRISA, France

Cite AsGet BibTex

Béatrice Bérard, Stefan Haar, and Loic Hélouët. Hyper Partial Order Logic. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 20:1-20:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSTTCS.2018.20

Abstract

We define HyPOL, a local hyper logic for partial order models, expressing properties of sets of runs. These properties depict shapes of causal dependencies in sets of partially ordered executions, with similarity relations defined as isomorphisms of past observations. Unsurprisingly, since comparison of projections are included, satisfiability of this logic is undecidable. We then address model checking of HyPOL and show that, already for safe Petri nets, the problem is undecidable. Fortunately, sensible restrictions of observations and nets allow us to bring back model checking of HyPOL to a decidable problem, namely model checking of MSO on graphs of bounded treewidth.

Subject Classification

ACM Subject Classification
  • Theory of computation → Logic and verification
Keywords
  • Partial orders
  • logic
  • hyper-logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. R. Alur, P. Cerný, and S. Chaudhuri. Model Checking on Trees with Path Equivalences. In TACAS 2007, volume 4424 of LNCS, pages 664-678. Springer, 2007. Google Scholar
  2. E. Badouel, M.A. Bednarczyk, A.M. Borzyszkowski, B. Caillaud, and P. Darondeau. Concurrent Secrets. Discrete Event Dynamic Systems, 17(4):425-446, 2007. Google Scholar
  3. P. Baldan, T. Chatain, S. Haar, and B. König. Unfolding-based Diagnosis of Systems with an Evolving Topology. In 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of LNCS, pages 203-217. Springer, 2008. URL: http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-concur08.pdf.
  4. P. Baldan, T. Chatain, S. Haar, and B. König. Unfolding-based Diagnosis of Systems with an Evolving Topology. Information and Computation, 208(10):1169-1192, October 2010. URL: http://dx.doi.org/10.1016/j.ic.2009.11.009.
  5. B. Bérard, S. Haar, and L. Hélouët. Hyper Partial Order Logic. HAL-Inria, 2018. URL: https://hal.inria.fr/hal-01884390.
  6. B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. In PETRI NETS'17, volume 10258 of LNCS, pages 200-220. Springer, 2017. Google Scholar
  7. B. Bérard, L. Hélouët, and J. Mullins. Non-interference in Partial Order Models. ACM Trans. Embedded Comput. Syst., 16(2):44:1-44:34, 2017. Google Scholar
  8. E. Best, P. Darondeau, and R. Gorrieri. On the Decidability of Non Interference over Unbounded Petri Nets. In Proc. of SecCo, volume 51 of EPTCS, pages 16-33, 2010. Google Scholar
  9. B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science, 6(3), 2010. Google Scholar
  10. M.R. Clarkson, B. Finkbeiner, M. Koleini, K.K. Micinski, M.N. Rabe, and C. Sánchez. Temporal Logics for Hyperproperties. In POST, pages 265-284, 2014. Google Scholar
  11. M.R. Clarkson and F.B. Schneider. Hyperproperties. Journal of Computer Security, 18(6):1157-1210, 2010. Google Scholar
  12. B. Courcelle and J. Engelfriet. Graph Structure and Monadic Second-Order Logic, a language theoretic approach. Cambridge Univ. Press, 2012. Google Scholar
  13. Bruno Courcelle. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput., 85(1):12-75, 1990. Google Scholar
  14. A. Cyriac, P. Gastin, and K.N. Narayan Kumar. MSO decidability of multi-pushdown systems via split-width. In CONCUR 2012, volume 7454 of LNCS, pages 547-561, 2012. Google Scholar
  15. J. Engelfriet. Branching Processes of Petri Nets. Acta Inf., 28(6):575-591, 1991. Google Scholar
  16. J. Esparza, S. Römer, and W. Vogler. An Improvement of McMillan’s Unfolding Algorithm. Formal Methods in System Design, 20(3):285-310, 2002. Google Scholar
  17. T. Gazagnaire, L. Hélouët, and S. S. Yang. Logic-based diagnosis for distributed systems. Perspectives in Concurrency, a festschrift for P.S. Thiagarajan, pages 482-505, 2009. Google Scholar
  18. J.A. Goguen and J. Meseguer. Security policies and security Models. In Proc. of IEEE Symposium on Security and Privacy, pages 11-20, 1982. Google Scholar
  19. A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of LNCS. Springer, 1992. Google Scholar
  20. C. Lautemann. Tree Automata, Tree Decomposition and Hyperedge Replacement. In Graph-Grammars and Their Application to Computer Science, 4th International Workshop, volume 532 of LNCS, pages 520-537. Springer, 1990. Google Scholar
  21. P. Madhusudan and B. Meenakshi. Beyond Message Sequence Graphs. In FST TCS'01: Foundations of Software Technology and Theoretical Computer Science, volume 2245 of LNCS, pages 256-267. Springer, 2001. Google Scholar
  22. P. Madhusudan, P.S. Thiagarajan, and S. Yang. The MSO Theory of Connectedly Communicating Processes. In FSTTCS'05, volume 3821 of LNCS, pages 201-212. Springer, 2005. Google Scholar
  23. H. Mantel. Possibilistic Definitions of Security - An Assembly Kit. In Proc. of the 13th IEEE Computer Security Foundations Workshop, (CSFW'00), pages 185-199, 2000. Google Scholar
  24. F. Mattern. Time and global states of distributed systems. Proc. Int. Workshop on Parallel and Distributed Algorithms, pages 215-226, 1988. Google Scholar
  25. K.L. McMillan. A Technique of State Space Search Based on Unfolding. Formal Methods in System Design, 6(1):45-65, 1995. Google Scholar
  26. B. Meenakshi and R. Ramanujam. Reasoning about layered message passing systems. Computer Languages, Systems & Structures, 30(3-4):171-206, 2004. Google Scholar
  27. D.A. Peled. Specification and Verification of Message Sequence Charts. In FORTE/PSTV'00, volume 183 of IFIP Conference Proceedings, pages 139-154. Kluwer, 2000. Google Scholar
  28. N. Robertson and P.D. Seymour. Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B, 52(2):153-190, 1991. Google Scholar
  29. A. Sabelfeld and A.C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, 2003. Google Scholar
  30. A. Spelten, W. Thomas, and S. Winter. Trees over Infinite Structures and Path Logics with Synchronization. In 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, volume 73 of EPTCS, pages 20-34, 2011. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact