MK-fuzzy Automata and MSO Logics

Manfred Droste; Teimuraz Kutsia; George Rahonis; Wolfgang Schreiner

MK-fuzzy Automata and MSO Logics

Manfred Droste, Teimuraz Kutsia, George Rahonis, Wolfgang Schreiner

Research Institute for Symbolic Computation

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizable MK-fuzzy languages accepted by MK-fuzzy automata as well as of deterministically recognizable MK-fuzzy languages accepted by their deterministic counterparts. Moreover, we establish a Nivat-like result for recognizable MK-fuzzy languages. We introduce an MK-fuzzy MSO logic and show the expressive equivalence of a fragment of this logic with MK-fuzzy automata, i.e., a B¨uchi type theorem.

Original language	English
Title of host publication	8th Symposium on Games, Automata, Logics and Formal Verification (GandALF'17)
Editors	P. Bouyer, A. Orlandini, P. San Pietro
Pages	106-120
Number of pages	15
Volume	256
Publication status	Published - Sept 2017

Publication series

Name	Electronic Proceedings in Theoretical Computer Science (EPTCS)
ISSN (Print)	2075-2180

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101009 Geometry
101012 Combinatorics
101013 Mathematical logic
101020 Technical mathematics

JKU Focus areas

Computation in Informatics and Mathematics

Cite this

@inproceedings{0d7b455746e84a8182f5bd8224b88003,

title = "MK-fuzzy Automata and MSO Logics",

abstract = "We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizable MK-fuzzy languages accepted by MK-fuzzy automata as well as of deterministically recognizable MK-fuzzy languages accepted by their deterministic counterparts. Moreover, we establish a Nivat-like result for recognizable MK-fuzzy languages. We introduce an MK-fuzzy MSO logic and show the expressive equivalence of a fragment of this logic with MK-fuzzy automata, i.e., a B¨uchi type theorem.",

author = "Manfred Droste and Teimuraz Kutsia and George Rahonis and Wolfgang Schreiner",

year = "2017",

month = sep,

language = "English",

volume = "256",

series = "Electronic Proceedings in Theoretical Computer Science (EPTCS)",

pages = "106--120",

editor = "{P. Bouyer, A. Orlandini, P. San Pietro}",

booktitle = "8th Symposium on Games, Automata, Logics and Formal Verification (GandALF'17)",

}

MK-fuzzy Automata and MSO Logics. / Droste, Manfred; Kutsia, Teimuraz; Rahonis, George et al.
8th Symposium on Games, Automata, Logics and Formal Verification (GandALF'17). ed. / P. Bouyer, A. Orlandini, P. San Pietro. Vol. 256 2017. p. 106-120 (Electronic Proceedings in Theoretical Computer Science (EPTCS)).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - MK-fuzzy Automata and MSO Logics

AU - Droste, Manfred

AU - Kutsia, Teimuraz

AU - Rahonis, George

AU - Schreiner, Wolfgang

PY - 2017/9

Y1 - 2017/9

N2 - We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizable MK-fuzzy languages accepted by MK-fuzzy automata as well as of deterministically recognizable MK-fuzzy languages accepted by their deterministic counterparts. Moreover, we establish a Nivat-like result for recognizable MK-fuzzy languages. We introduce an MK-fuzzy MSO logic and show the expressive equivalence of a fragment of this logic with MK-fuzzy automata, i.e., a B¨uchi type theorem.

AB - We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizable MK-fuzzy languages accepted by MK-fuzzy automata as well as of deterministically recognizable MK-fuzzy languages accepted by their deterministic counterparts. Moreover, we establish a Nivat-like result for recognizable MK-fuzzy languages. We introduce an MK-fuzzy MSO logic and show the expressive equivalence of a fragment of this logic with MK-fuzzy automata, i.e., a B¨uchi type theorem.

M3 - Conference proceedings

VL - 256

T3 - Electronic Proceedings in Theoretical Computer Science (EPTCS)

SP - 106

EP - 120

BT - 8th Symposium on Games, Automata, Logics and Formal Verification (GandALF'17)

A2 - P. Bouyer, A. Orlandini, P. San Pietro, null

ER -