Skip to main content

Extracting Environmental Constraints in Reactive System Specifications

  • Conference paper
  • First Online:

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

Abstract

Reactive systems ideally never terminate and maintain some interaction with their environment. Temporal logic is one of the methods for formal specification description of reactive systems. For a reactive system specification, we do not always obtain a program that satisfies it because the reactive system program must satisfy the specification no matter how the environment of the reactive system behaves. This problem is known as realizability or feasibility. The complexity of deciding realizability of specifications that are described in linear temporal logic is double or triple exponential time of the length of specifications and realizability decision is impractical. To check reactive system specifications, Strong satisfiability is one of the necessary conditions of realizability of reactive system specifications. If a reactive system specification is not strong satisfiable, it is necessary to revise the specification. This paper proposes the method of revising reactive system specifications that are not strong satisfiable. This method extracts environmental constraints that are included in reactive system specifications.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) Automata, Languages and Programming. LNCS, vol. 372, pp. 1–17. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  2. Bouyer, P., Bozzelli, L., Chevalier, F.: Controller synthesis for MTL specifications. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 450–464. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Duer-Luts, A.: LTL translation improvements in Spot. In: Proceedings of the Fifth International Conference on Verification and Evaluation of Computer and Communication Systems, pp. 72–83 (2011)

    Google Scholar 

  4. Filiot, E., Jin, N., Raskin, J.F.: An Antichain Algorithm for LTL Realizaibility. Formal Methods in System Design archive 39(3), 261–296 (2011)

    Article  MATH  Google Scholar 

  5. Harel, D., Pnueli, A.: On the development of reactive systems. In: Logics and Models of Concurrent Systems, pp. 477–498 (1985)

    Google Scholar 

  6. Kupferman, O., Madhusudan, P., Thiagarajan, P.S., Vardi, M.Y.: Open systems in reactive environments: control and synthesis. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 92–107. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Mori, R., Yonezaki, N.: Derivation of the input conditional formula from a reactive system specification in temporal logic. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, pp. 567–582. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  8. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 179–190 (1989)

    Google Scholar 

  9. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Mori, R., Yonezaki, N.: Several Realizability Concepts in Reactive Objects, Information Modeling and Knowledge Bases. IOS Press (1993)

    Google Scholar 

  11. Tarjan, R.E.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  12. Tsay, Y.-K., Chen, Y.-F., Tsai, M.-H., Wu, K.-N., Chan, W.-C.: GOAL: a graphical tool for manipulating Büchi automata and temporal formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 466–471. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Hagihara, S, Kitamura, Y., Shimakawa, M., Yonezaki, N.: Extracting environmental constraints to make reactive system specifications realizable In: Proceedings of 16th Asia-Pacific Software Engineering Conference, pp. 61–68 (2009)

    Google Scholar 

  14. Cimatti, A., Roveri, M., Schuppan, V., Tchaltsev, A.: Diagnostic information for realizability. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 52–67. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Noriaki Yoshiura .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Fukaya, Y., Yoshiura, N. (2015). Extracting Environmental Constraints in Reactive System Specifications. In: Gervasi, O., et al. Computational Science and Its Applications -- ICCSA 2015. ICCSA 2015. Lecture Notes in Computer Science(), vol 9158. Springer, Cham. https://doi.org/10.1007/978-3-319-21410-8_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21410-8_51

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21409-2

  • Online ISBN: 978-3-319-21410-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics