Skip to main content
SpringerLink
Log in

Quotient of Acceptance Specifications Under Reachability Constraints

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

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

Abstract

The quotient operation, which is dual to the composition, is crucial in specification theories as it allows the synthesis of missing specifications and thus enables incremental design. In this paper, we consider a specification theory based on marked acceptance specifications (MAS) which are automata enriched with variability information encoded by acceptance sets and with reachability constraints on states. We define a sound and complete quotient for MAS hence ensuring reachability properties by construction.

A full version with proofs is available online [17].

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauer, S.S., Fahrenberg, U., Juhl, L., Larsen, K.G., Legay, A., Thrane, C.R.: Weighted modal transition systems. Formal Methods in System Design 42(2), 193–220 (2013)

    Article  MATH  Google Scholar 

  2. Bauer, S.S., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: A modal specification theory for components with data. Sci. Comput. Program. 83, 106–128 (2014)

    Article  Google Scholar 

  3. Beneš, N., Delahaye, B., Fahrenberg, U., Křet\’ınský, J., Legay, A.: Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 – Concurrency Theory. LNCS, vol. 8052, pp. 76–90. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Beneš, N., Černá, I., Křet\’ınský, J.: Modal Transition Systems: Composition and LTL Model Checking. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 228–242. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Beneš, N., Křet\’ınský, J., Larsen, K.G., Møller, M.H., Srba, J.: Parametric Modal Transition Systems. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 275–289. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Benveniste, A., Raclet, J.B., Caillaud, B., Nickovic, D., Passerone, R., Sangiovanni-Vincentelli, A., Henzinger, T., Larsen, K.G.: Contracts for the design of embedded systems - part II: theory (2012)

    Google Scholar 

  7. Bertrand, N., Legay, A., Pinchinat, S., Raclet, J.B.: Modal event-clock specifications for timed component-based design. Sci. Comput. Program. 77(12), 1212–1234 (2012)

    Article  MATH  Google Scholar 

  8. Caillaud, B., Raclet, J.-B.: Ensuring Reachability by Design. In: Roychoudhury, A., D’Souza, M. (eds.) ICTAC 2012. LNCS, vol. 7521, pp. 213–227. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Chen, T., Chilton, C., Jonsson, B., Kwiatkowska, M.: A Compositional Specification Theory for Component Behaviours. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol. 7211, pp. 148–168. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Darondeau, P., Dubreil, J., Marchand, H.: Supervisory control for modal specifications of services. In: WODES. pp. 428–435 (2010)

    Google Scholar 

  11. David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Timed I/O automata : A complete specification theory for real-time systems. In: HSCC. pp. 91–100. ACM (2010)

    Google Scholar 

  12. Hennessy, M.: Acceptance trees. J. ACM 32(4), 896–928 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS. pp. 203–210. IEEE (1988)

    Google Scholar 

  14. Lüttgen, G., Vogler, W.: Modal interface automata. Logical Methods in Computer Science 9(3) (2013)

    Google Scholar 

  15. Raclet, J.B.: Residual for component specifications. FACS. Electr. Notes Theor. Comput. Sci. 215, 93–110 (2008)

    Article  Google Scholar 

  16. Raclet, J.B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: A modal interface theory for component-based design. Fun. Informaticae 108(1–2), 119–149 (2011)

    MATH  MathSciNet  Google Scholar 

  17. Verdier, G., Raclet, J.B.: Quotient of acceptance specifications under reachability constraints. arXiv:1411.6463 (2014)

Download references

Author information

Authors and Affiliations

  1. IRIT/CNRS, 118 Route de Narbonne, 31062, Toulouse Cedex 9, France

    Guillaume Verdier & Jean-Baptiste Raclet

Authors
  1. Guillaume Verdier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Baptiste Raclet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guillaume Verdier .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Verdier, G., Raclet, JB. (2015). Quotient of Acceptance Specifications Under Reachability Constraints. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation