ω-Forest Algebras and Temporal Logics

03/25/2022
by   Achim Blumensath, et al.
0

We use the algebraic framework for languages of infinite trees introduced in [4] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.

READ FULL TEXT
research
05/23/2019

Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations

Our concern is the axiomatisation problem for modal and algebraic logics...
research
10/31/2018

Multirobot Coordination with Counting Temporal Logics

In many multirobot applications, planning trajectories in a way to guara...
research
01/05/2018

Intelligence Graph

In fact, there exist three genres of intelligence architectures: logics ...
research
04/14/2022

Mortensen Logics

Mortensen introduced a connexive logic commonly known as 'M3V'. M3V is o...
research
09/01/2020

A Deontic Logic Analysis of Autonomous Systems' Safety

We consider the pressing question of how to model, verify, and ensure th...
research
07/02/2019

Logics for Reversible Regular Languages and Semigroups with Involution

We present MSO and FO logics with predicates `between' and `neighbour' t...
research
04/19/2023

The Krohn-Rhodes Logics

We present a new family of modal temporal logics of the past, obtained b...

Please sign up or login with your details

Forgot password? Click here to reset