Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
复制标题

在强大的可判定逻辑和定时自动机中指定定时状态序列

DOI：
--
复制
发表时间：
1994
期刊：
Formal Techniques in Real-Time and Fault-Tolerant Systems
影响因子：
--
通讯作者：
T. Wilke
T. Wilke
中科院分区：
--
文献类型：
--
作者：
T. Wilke

文献摘要

被引文献

相似文献

引入一元二阶语言（mathcal{L}d）来描述时间状态序列集合。（mathcal{L}d）的片段，用。表示
A monadic second-order language, denoted by (mathcal{L}d), is introduced for the specification of sets of timed state sequences. A fragment of (mathcal{L}d), denoted by , is proved to be expressively complete for timed automata (Alur and Dill), i.e., every timed regular language is definable by a -formula and every -formula defines a timed regular language. As a consequence the satisfiability problem for is decidable.