Dynamic logic assigned to automata

DOI10.1007/S10773-017-3311-0MaRDI QIDQ682633zbMATH OpenOpenAlexFDO

Authors Ivan Chajda, Jan Paseka

Publication date 5 February 2018

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.04456

zbMATH Keywords

automatondynamic logicmodal functorstate-transition relationtransition functor

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Logic in computer science (03B70) Quantum logic (03G12) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

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

Recommendations

• scientific article; zbMATH DE number 1556014
• A nondeterministic program logic
• ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS
• Dynamic logic with trace semantics
• Dynamic logic of propositional assignments: a well-behaved variant of PDL

Cites work

• scientific article; zbMATH DE number 1028831 (Why is no real title available?)
• Algebraic approach to tense operators
• Alternating automata and temporal logic normal forms
• An introduction to practical formal methods using temporal logic
• Combined model checking for temporal, probabilistic, and real-time logics
• Determinization of fuzzy automata via factorization of fuzzy states
• Dynamic effect algebras and their representations
• Dynamic order algebras as an axiomatization of modal and tense logics
• Finite automata theory with membership values in lattices
• Free quantum field theory from quantum cellular automata
• Lattices and ordered algebraic structures
• The complementation problem for Büchi automata with applications to temporal logic
• The representation of posets and lattices by sets
• Transition operators assigned to physical systems

Cited in

(1)

• Algebraic structures formalizing the logic of effect algebras incorporating time dimension

This page was built for publication: Dynamic logic assigned to automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682633)