TY - GEN

T1 - Modal mu-calculus extension with description of autonomy and its algebraic structure

AU - Yamasaki, Susumu

AU - Sasakura, Mariko

N1 - Publisher Copyright:
© 2020 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020

Y1 - 2020

N2 - This paper deals with complex abstract state machinery, clearly represented by modal logic with fixed point operator. The logic is well known as modal mu-calculus, which is extended to the version involving human computer interaction as well as involving awareness, communication and behavioral predicates of propositional variables as in autonomy systems. The extended version contains complexity for human machine interaction, whose meaning is represented by Heyting algebra but not by Boolean algebra. In the sense of Heyting algebra, human computer interaction of complexity can be described such that related predicates of communication and behavior may be simplified. Then the extended version can be applied to some process by means of awareness to an expertise, communication and behavior processes, and repetitions represented with fixed point operator (that is, mu-operator). This version is also concerned with model theory caused by postfix modal operator, where composition and alternation of modal operators may be organized into an algebraic structure.

AB - This paper deals with complex abstract state machinery, clearly represented by modal logic with fixed point operator. The logic is well known as modal mu-calculus, which is extended to the version involving human computer interaction as well as involving awareness, communication and behavioral predicates of propositional variables as in autonomy systems. The extended version contains complexity for human machine interaction, whose meaning is represented by Heyting algebra but not by Boolean algebra. In the sense of Heyting algebra, human computer interaction of complexity can be described such that related predicates of communication and behavior may be simplified. Then the extended version can be applied to some process by means of awareness to an expertise, communication and behavior processes, and repetitions represented with fixed point operator (that is, mu-operator). This version is also concerned with model theory caused by postfix modal operator, where composition and alternation of modal operators may be organized into an algebraic structure.

KW - Abstract State Machinery

KW - Application to Autonomy

KW - Fixed Point

KW - Human Computer Interaction

KW - Modal Logic

UR - http://www.scopus.com/inward/record.url?scp=85090385373&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85090385373&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85090385373

T3 - COMPLEXIS 2020 - Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk

SP - 63

EP - 71

BT - COMPLEXIS 2020 - Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk

A2 - Behringer, Reinhold

A2 - Chang, Victor

PB - SciTePress

T2 - 5th International Conference on Complexity, Future Information Systems and Risk, COMPLEXIS 2020

Y2 - 8 May 2020 through 9 May 2020

ER -