The paper focuses on automata and linear temporal logics for real-time pushdown reactive systems bridging tractable formalisms specialized for expressing separately dense-time real-time properties and context-free properties though preserving tractability. As for automata, we introduce Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA enjoy the same closure and decidability properties of ECA and VPA expressively extending any previous attempt of combining ECA and VPA. As for temporal logics, we introduce two formalisms for specifying quantitative timing context-free requirements: Event-Clock Nested Temporal Logic (EC_NTL) and Nested Metric Temporal Logic (NMTL). EC_NTL is an extension of both the logic CaRet and Event-Clock Temporal Logic having Exptime-complete satisfiability of EC_NTL and visibly model-checking of Visibly Pushdown Timed Systems (VPTS) against EC_NTL. NMTL is a context-free extension of standard Metric Temporal Logic (MTL) which is in general undecidable having, though, a fragment expressively equivalent to EC_NTL with Exptime-complete satisfiability and visibly model-checking of VPTS problems.

本文侧重于实时下推反应系统的自动机和线性时间逻辑，它们在保持易处理性的同时，桥接了专门用于分别表示密集实时属性和无上下文属性的易处理形式。至于自动机，我们介绍了事件时钟嵌套自动机（ECNA），这是一种结合了事件时钟自动机（ECA）和可视下推自动机（VPA）的形式。ECNA享有与ECA和VPA相同的封闭性和可判定性属性，这极大地扩展了之前任何结合ECA和VPA的尝试. 至于时序逻辑，我们引入了两种形式来指定定量时序无上下文要求：事件时钟嵌套时序逻辑（EC_NTL）和嵌套度量时序逻辑（NMTL）。EC_NTL是逻辑CaRet和事件时钟时间逻辑的扩展，具有EC_NTL的Exptime完全可满足性和针对EC_NTL的可见下推定时系统 ( VPTS )的可见模型检查。NMTL是标准度量时间逻辑（MTL) 这通常是不可判定的，但它有一个片段表达地等同于EC_NTL与Exptime 完全可满足性和VPTS问题的可见模型检查。