Towards Agents-Based Model Checking
Norihiro Kamide
Abstract
Norihiro Kamide
Abstract
A new logic, agents-indexed computation tree logic (ACTL), is obtained from the standard computation tree logic CTL by adding some agent operators. ACTL is intended to appropriately formalize reasoning about agents-based (or distributed) concurrent systems within an executable temporal logic by model checking. The model-checking, validity and satisfiability problems of ACTL are shown to be decidable.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A new logic, agents-indexed computation tree logic (ACTL), is obtained from the standard computation tree logic CTL by adding some agent operators. ACTL is intended to appropriately formalize reasoning about agents-based (or distributed) concurrent systems within an executable temporal logic by model checking. The model-checking, validity and satisfiability problems of ACTL are shown to be decidable.
Key concepts: Computation tree logic, Model checking, Computer science, Executable, Temporal logic, Decidability, Satisfiability, Theoretical computer science