Abstract
When creating system models, further to system behaviour one should take into account properties of the environment in order to achieve more meaningful models. Here, we extend a strategy that formalises data-flow reactive systems as CSP processes to take into account environment restrictions. Initially, these restrictions are written in natural language. Afterwards, with the aid of case-grammar theory, they are formalised by deriving LTL formulae automatically. Finally, these formulae are used to prune infeasible scenarios from the CSP-based system specification, in the light of the environment restrictions. Considering examples from the literature, and from the aerospace (Embraer) and the automotive (Mercedes) industry, we show the efficacy of our proposal in terms of state space reduction, up to 61% in some cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
- 2.
- 3.
- 4.
Considering an i7-5500U @ 2.40 GHz 4, 8 GB of RAM, with Ubuntu 16.04 LTS.
- 5.
- 6.
References
Allerton, D.J.: Valency grammar. In: Brown, K. (ed.) The Encyclopedia of Language and Linguistics, pp. 301–314. Elsevier Science Ltd. (2006)
Carvalho, G.: NAT2TEST: generating test cases from natural language requirements based on CSP. Ph.D. thesis, Centro de Informática, UFPE, Brazil (2016)
Carvalho, G., Barros, F., Carvalho, A., Cavalcanti, A., Mota, A., Sampaio, A.: NAT2TEST tool: from natural language requirements to test cases based on CSP. In: Calinescu, R., Rumpe, B. (eds.) SEFM 2015. LNCS, vol. 9276, pp. 283–290. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22969-0_20
Carvalho, G., Cavalcanti, A., Sampaio, A.: Modelling timed reactive systems from natural-language requirements. Form. Asp. Comput. 28(5), 725–765 (2016)
Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: Proceedings of the 21st International Conference on Software Engineering, ICSE 1999, pp. 411–420. ACM, New York (1999)
Fantechi, A., Gnesi, S., Ristori, G., Carenini, M., Vanocchi, M., Moreschini, P.: Assisting requirement formalization by means of natural language translation. Form. Methods Syst. Des. 4(3), 243–263 (1994)
Fillmore, C.J.: The case for case. In: Bach, E., Harms, R.T. (eds.) Universals in Linguistic Theory, pp. 1–88. Holt, Rinehart, and Winston, New York (1968)
Gibson-Robinson, T., et al.: FDR: from theory to industrial application. In: Gibson-Robinson, T., Hopcroft, P., Lazić, R. (eds.) Concurrency, Security, and Puzzles. LNCS, vol. 10160, pp. 65–87. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-51046-0_4
Larsen, K.G., Mikucionis, M., Nielsen, B.: Online testing of real-time systems using Uppaal. In: Grabowski, J., Nielsen, B. (eds.) FATES 2004. LNCS, vol. 3395, pp. 79–94. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31848-4_6
Leonard, E., Heitmeyer, C.: Program synthesis from formal requirements specifications using APTS. High. Order Symbol. Comput. 16, 63–92 (2003)
Leuschel, M., Currie, A., Massart, T.: How to make FDR spin LTL model checking of CSP by refinement. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 99–118. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45251-6_6
Lignos, C., Raman, V., Finucane, C., Marcus, M., Kress-Gazit, H.: Provably correct reactive control from natural language. Auton. Robot. 38(1), 89–105 (2015)
Ma, C., Provost, J.: A model-based testing framework with reduced set of test cases for programmable controllers. In: Proceedings of the IEEE Conference on Automation Science and Engineering, pp. 944–949. IEEE (2017)
Peleska, J., Vorobev, E., Lapschies, F., Zahlten, C.: Automated model-based testing with RT-tester. Universität Bremen, Technical report (2011)
Pnueli, A.: The temporal semantics of concurrent programs. Theor. Comput. Sci. 13(1), 45–60 (1981)
Roscoe, A.W.: Understanding Concurrent Systems. Springer, London (2010). https://doi.org/10.1007/978-1-84882-258-0
Yan, R., Cheng, C.H., Chai, Y.: Formal consistency checking over specifications in natural languages. In: Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, pp. 1677–1682. EDA Consortium (2015)
Acknowledgements
This work is partially supported by INES (www.ines.org.br), CNPq grant 465614 /2014-0 and FACEPE grants APQ-0399-1.03/17 and PRONEX APQ/0388-1.03 /14. It is also partially supported by the CIn-UFPE and Motorola cooperation project, as well as by the CNPq grants 303022/2012-4 and 132332/2015-9.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Santos, T., Carvalho, G., Sampaio, A. (2018). Formal Modelling of Environment Restrictions from Natural-Language Requirements. In: Massoni, T., Mousavi, M. (eds) Formal Methods: Foundations and Applications. SBMF 2018. Lecture Notes in Computer Science(), vol 11254. Springer, Cham. https://doi.org/10.1007/978-3-030-03044-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-03044-5_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03043-8
Online ISBN: 978-3-030-03044-5
eBook Packages: Computer ScienceComputer Science (R0)