Model checking real-time conditional commitment logic using transformation

被引:13
作者
El Menshawy, Mohamed [1 ,2 ]
Bentahar, Jamal [1 ]
El Kholy, Warda [1 ]
Laarej, Amine [1 ]
机构
[1] Concordia Univ, Concordia Inst Informat Syst Engn, Fac Engn & Comp Sci, Montreal, PQ, Canada
[2] Menoufia Univ, Comp Sci, Fac Comp & Informat, Shibin Al Kawm, Menofia Governo, Egypt
关键词
Real-time; Qualitative and quantitative commitment requirements; Transformation technique; Complexity; VERIFICATION; COMPLEXITY;
D O I
10.1016/j.jss.2017.12.042
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A new logical language for real-time conditional commitments called RTCTLcc has been developed by extending the CTL logic with interval bounded until modalities, conditional commitment modalities, and fulfillment modalities. RTCTLcc allows us to express qualitative and quantitative commitment requirements in a convenient way. These requirements can be used to model multi-agent systems (MASs) employed in environments that react properly and timely to events occurring at time instants or within time intervals. However, the timing requirements and behaviors of MASs need an appropriate way to scale and bundle and should be carefully analyzed to ensure their correctness, especially when agents are autonomous. In this paper, we develop transformation algorithms that are fully implemented in a new Java toolkit for automatically transforming the problem of model checking RTCTLcc into the problem of model checking RTCTL (real-time CTL). The toolkit engine is built on top of the NuSMV tool, effectively used to automatically verify and analyze the correctness of real-time distributed systems. We analyzed the time and space computational complexity of the RICTLcc model checking problem. We proved the soundness and completeness of the transformation technique and experimentally evaluated the validity of the toolkit using a set of business scenarios. Moreover, we added a capability in the toolkit to automatically scale MASs and to bundle requirements in a parametric form. We experimentally evaluated the scalability aspect of our approach using the standard ordering protocol. We further validated the approach using an industrial case study. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:189 / 205
页数:17
相关论文
共 34 条
[1]   Model checking temporal knowledge and commitments in multi-agent systems using reduction [J].
Al-Saqqar, Faisal ;
Bentahar, Jamal ;
Sultan, Khalid ;
Wan, Wei ;
Asl, Ehsan Khosrowshahi .
SIMULATION MODELLING PRACTICE AND THEORY, 2015, 51 :45-68
[2]   The benefits of relaxing punctuality [J].
Alur, R ;
Feder, T ;
Henzinger, TA .
JOURNAL OF THE ACM, 1996, 43 (01) :116-146
[3]  
[Anonymous], 1995, Reasoning About Knowledge
[4]  
[Anonymous], 2002, P 4 INTERNATIONA WOR
[5]  
Baldoni M, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P10
[6]   Communicative commitments: Model checking and complexity analysis [J].
Bentahar, Jamal ;
El-Menshawy, Mohamed ;
Qu, Hongyang ;
Dssouli, Rachida .
KNOWLEDGE-BASED SYSTEMS, 2012, 35 :21-34
[7]  
Boniol F., 2014, ABZ 2014 LANDING GEA, P1
[8]   Representing and monitoring social commitments using the event calculus [J].
Chesani, Federico ;
Mello, Paola ;
Montali, Marco ;
Torroni, Paolo .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2013, 27 (01) :85-130
[9]  
Chopra AK, 2015, AAAI CONF ARTIF INTE, P2052
[10]  
Cimatti A., 2002, Computer Aided Verification. 14th International Conference, CAV 2002. Proceedings (Lecture Notes in Computer Science Vol.2404), P359