Modal Mu-calculus Extension with Description of Autonomy and Its Algebraic Structure

摘要

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.