[草稿] 基于高阶估计的性质和高阶观测器用于标记有限状态自动机
[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
AI总结:
本文提出了一种基于高阶估计性质的框架,通过高阶观察器验证标记有限状态自动机的属性。
摘要:
在本文中,我们考虑标记有限状态自动机(LFSAs),将一些基于状态估计的性质从单个代理扩展到有限有序集的代理。我们还利用我们的并发组合扩展观察者的概念为\emph{高阶观察者}。作为结果,建立了一个用于表征高阶估计性质的一般框架,在此框架中,每个代理通过所有前面的代理推断其前一个代理的估计。高阶观察器在验证这些性质中扮演基本工具的角色。在更详细的框架中,系统的结构对所有代理$A_1,\dots,A_n$公开;每个代理$A_i$有自己的可观测事件集$E_i$,并且还知道所有前面代理的可观测事件,但只能观察自己的可观测事件。我们高阶观察器的直观意义是表征代理$A_n$了解代理$A_{n-1}$了解……代理$A_2$了解代理$A_1$的系统状态估计的内容。这个一般框架可以被视为动态知识逻辑的自动机表示。与基于逻辑片段的经典动态知识逻辑表示相比,我们的表示在属性验证和灵活更改代理以强制属性方面具有优势。作为案例研究,这个一般框架应用于当前状态不透明性、强当前状态不透明性、基于正则语言的不透明性、关键可观测性、高阶不透明性等基本属性。讨论了验证更高效的一些特殊情况。
英文摘要:
In this paper, we consider labeled finite-state automata (LFSAs), extend some state estimation-based properties from a single agent to a finite ordered set of agents. We also extend the notion of observer to \emph{high-order observer} using our \emph{concurrent composition}. As a result, a general framework for characterizing high-order estimation-based properties is built, in which each agent infers its preceding agent's estimation via all agents in front. The high-order observer plays the role of a basic tool to verify such properties. In more detail, in our general framework, the system's structure is publicly known to all agents $A_1,\dots,A_n$; each agent $A_i$ has its own observable event set $E_i$, and additionally knows all its preceding agents' observable events but can only observe its own observable events. The intuitive meaning of our high-order observer is to characterize what agent $A_n$ knows about what $A_{n-1}$ knows about \dots what $A_2$ knows about $A_1$'s state estimate of the system. This general framework can be regarded as an automata representation of dynamic epistemic logic. Compared with the classical representation of dynamic epistemic logic based on fragments of logic, our representation has advantages in property verification and flexibly changing agents to enforce properties. As case studies, this general framework applies to basic properties such as current-state opacity, strong current-state opacity, regular-language-based opacity, critical observability, high-order opacity, etc. Special cases for which verification can be done more efficiently are also discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。