Efficient Temporal Logic Verification by Incremental Abstraction
Paper in proceedings, 2020

A recently formulated incremental abstraction method that preserves CTL∗-X is further developed and evaluated in this paper. The temporal logic CTL∗-X includes both linear temporal logic (LTL) and computational tree logic (CTL), except for the next operator (often denoted by X). For a modular transition system, the incremental abstraction means that any local events, only included in one of the subsystems, are first abstracted. After synchronization more events become local. Repeated abstraction then means that further reduction of local transitions is achieved when more submodels are synchronized. This incremental abstraction is evaluated as a tool for temporal logic verification, and compared with a couple of competitive alternatives. In a preliminary evaluation, the proposed incremental abstraction is often shown to be the most efficient choice for verification of temporal logic properties, especially when some individual submodels are comparatively large.

nonblocking verification

modular systems

temporal logic verification

Author

Bengt Lennartson

Chalmers, Electrical Engineering, Systems and control

Xudong Liang

Student at Chalmers

Mona Noori-Hosseini

Chalmers, Electrical Engineering, Systems and control, Automation

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

Vol. 2020-August 894-899 9216950

16th IEEE International Conference on Automation Science and Engineering, CASE 2020
Hong Kong, Hong Kong,

Subject Categories

Other Engineering and Technologies not elsewhere specified

Embedded Systems

Computer Science

DOI

10.1109/CASE48305.2020.9216950

More information

Latest update

3/8/2021 1