Skip to main content
SpringerLink
Log in

Parameterised Verification of Publish/Subscribe Networks with Exception Handling

  • Conference paper
  • First Online:
Reachability Problems (RP 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11674))

Included in the following conference series:

  • 284 Accesses

Abstract

We present a formal model of publish/subscribe network architectures in which a central communication broker is in charge of distributing messages to clients subscribed to certain topics. We consider different semantics for the notification phase in order to take into consideration exceptions due to node crashes. For the considered model, we study decidability of verification problems formulated in terms of coverability, a non trivial class of reachability problems well-suited to validate properties of parameterised systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

References

  1. Abdulla, P.A., Delzanno, G.: Parameterized verification. STTT 18(5), 469–473 (2016)

    Article  Google Scholar 

  2. Abdulla, P.A., Jonsson, B.: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1–2), 145–167 (2001)

    Article  MathSciNet  Google Scholar 

  3. Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2015)

    Book  Google Scholar 

  4. Bloem, R., et al.: Decidability in parameterized verification. SIGACT News 47(2), 53–64 (2016)

    Article  MathSciNet  Google Scholar 

  5. Conchon, S., Delzanno, G., Ferrando, A.: Parameterized verification of topology-sensitive distributed protocols goes declarative. In: NETYS 2018, pp. 209–224 (2018)

    Google Scholar 

  6. Delzanno, G.: Constraint-based model checking for parameterized synchronous systems. In: Armando, A. (ed.) FroCoS 2002. LNCS (LNAI), vol. 2309, pp. 72–86. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45988-X_7

    Chapter  MATH  Google Scholar 

  7. Delzanno, G.: A logic-based approach to verify distributed protocols. In: CILC 2016, pp. 86–101 (2016)

    Google Scholar 

  8. Delzanno, G.: A unified view of parameterized verification of abstract models of broadcast communication. STTT 18(5), 475–493 (2016)

    Article  Google Scholar 

  9. Delzanno, G.: Formal verification of internet of things protocols. In: FRIDA@FLOC (2018)

    Google Scholar 

  10. Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313–327. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15375-4_22

    Chapter  Google Scholar 

  11. Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 441–455. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19805-2_30

    Chapter  MATH  Google Scholar 

  12. Delzanno, G., Sangnier, A., Zavattaro, G.: Verification of ad hoc networks with node and communication failures. In: Giese, H., Rosu, G. (eds.) FMOODS/FORTE -2012. LNCS, vol. 7273, pp. 235–250. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30793-5_15

    Chapter  Google Scholar 

  13. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35(4), 413–422 (1913)

    Article  MathSciNet  Google Scholar 

  14. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1–2), 63–92 (2001)

    Article  MathSciNet  Google Scholar 

  15. Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1–2), 1–29 (2004)

    Article  MathSciNet  Google Scholar 

  16. Higman, G.: Ordering by divisibility in abstract algebras. Proc Lond. Math. Soc. 2(7), 326–336 (1952)

    Article  MathSciNet  Google Scholar 

  17. Kretínský, M., Rehák, V., Strejcek, J.: On extensions of process rewrite systems: rewrite systems with weak finite-state unit. Electr. Notes Theor. Comput. Sci. 98, 75–88 (2004)

    Article  Google Scholar 

  18. Kretínský, M., Rehák, V., Strejcek, J.: Extended process rewrite systems: expressiveness and reachability. In: CONCUR 2004, pp. 355–370 (2004)

    Chapter  Google Scholar 

  19. Mayr, R.: Process rewrite systems. Inf. Comput. 156(1–2), 264–286 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIBRIS, University of Genova, Genoa, Italy

    Giorgio Delzanno

Authors
  1. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giorgio Delzanno .

Editor information

Editors and Affiliations

  1. Université Libre de Bruxelles, Brussels, Belgium

    Emmanuel Filiot

  2. Université Catholique de Louvain, Louvain-la-Neuve, Belgium

    Raphaël Jungers

  3. University of Liverpool, Liverpool, UK

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Delzanno, G. (2019). Parameterised Verification of Publish/Subscribe Networks with Exception Handling. In: Filiot, E., Jungers, R., Potapov, I. (eds) Reachability Problems. RP 2019. Lecture Notes in Computer Science(), vol 11674. Springer, Cham. https://doi.org/10.1007/978-3-030-30806-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30806-3_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30805-6

  • Online ISBN: 978-3-030-30806-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation