Work

A Team Based Variant of CTL

Year: 2015
Type: conference-paper
Abstract: We introduce two variants of computation tree logic CTL based on team semantics: an asynchronous one and a synchronous one. For both variants we investigate the computational complexity of the satisfiability as well as the model checking problem. The satisfiability problem is shown to be EXPTIME-complete. Here it does not matter which of the two semantics are considered. For model checking we prove a PSPACE-completeess for the synchronous case, and show P-completeness for the asynchronous case. Furthermore we prove several interesting fundamental properties of both semantics.
Language: English
Open Access status: green
OpenAlex ID: W925486019
FWCI: 0.763
Cites: 37
Cited by: 28
Related to: 9