A Presheaf Semantics for Quantified Temporal Logics
Lecture Notes in Computer Science(2023)
摘要
Temporal logics encompass a family of formalisms for the verification of computational devices, and its quantified extensions allow to reason about the properties of individual components of a system. The expressiveness of these logics poses problems in identifying a semantics that exploits its features without imposing restrictions on the acceptable behaviours. We address this issue by introducing a counterpart-based semantics and we provide a categorical presentation of such semantics in terms of relational presheaves.
更多查看译文
关键词
presheaf semantics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要