1. What contributions have the authors mentioned in the paper "Operator precedence temporal logic and model checking" ?
In this paper the authors present a new temporal logic suitable to express and automatically verify properties of operator precedence languages.. The authors prove that their logic is at least as expressive as analogous logics defined for visible pushdown languages yet covering a much more powerful family ; they design a procedure that, given a formula in their logic builds an automaton recognizing the sentences satisfying the formula, whose size is at most exponential in the length of the formula.
read more
2. What are the future works in "Operator precedence temporal logic and model checking" ?
OPTL can convey more properties than other similar temporal logics, with the possibility of model checking with an automaton of size not greater than competing formalisms.. Such a possible result, joined with a FO-complete temporal logic would allow to extend most classical results on logic characterization and model checking of regular languages to the much wider class of OPLs.. On the side of practical application, the authors are planning the development and implementation of suitable model checking algorithms based on the theoretical procedures presented in this paper.. A further natural step in the theoretical characterization of OPTL is a more complete exploration of its power, in particular concerning First-Order completeness, as it has been done for various temporal logics, including NWTL [ 12 ].
read more
