Dynamic logic assigned to automata

09/11/2018
by   Ivan Chajda, et al.
0

A dynamic logic B can be assigned to every automaton A without regard if A is deterministic or nondeterministic. This logic enables us to formulate observations on A in the form of composed propositions and, due to a transition functor T, it captures the dynamic behaviour of A. There are formulated conditions under which the automaton A can be recovered by means of B and T.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2023

Rudin-Shapiro Sums Via Automata Theory and Logic

We show how to obtain, via a unified framework provided by logic and aut...
research
01/13/2020

Good-for-games ω-Pushdown Automata

We introduce good-for-games ω-pushdown automata (ω-GFG-PDA). These are a...
research
06/22/2020

Expressive Logics for Coinductive Predicates

The classical Hennessy-Milner theorem says that two states of an image-f...
research
07/03/2018

On Runtime Enforcement via Suppressions

Runtime enforcement is a dynamic analysis technique that uses monitors t...
research
09/16/2023

Dynamic Separation Logic

This paper introduces a dynamic logic extension of separation logic. The...
research
04/11/2017

Beliefs and Probability in Bacchus' l.p. Logic: A 3-Valued Logic Solution to Apparent Counter-intuition

Fundamental discrepancy between first order logic and statistical infere...
research
03/30/2023

Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs

This paper introduces a uniform substitution calculus for dℒ_CHP, the dy...

Please sign up or login with your details

Forgot password? Click here to reset