当前位置: X-MOL 学术Inf. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Polynomial interrupt timed automata: Verification and expressiveness
Information and Computation ( IF 1 ) Pub Date : 2020-04-01 , DOI: 10.1016/j.ic.2020.104580
B. Bérard , S. Haddad , C. Picaronny , M. Safey El Din , M. Sassolas

Interrupt Timed Automata (ITA ) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (PolITA ). We prove that reachability is decidable in 2EXPTIME on PolITA, using an adaptation of the cylindrical algebraic decomposition algorithm for the first-order theory of reals. We also obtain decidability for the model checking of a timed version of CTL and for reachability in several extensions of PolITA. In particular, compared to previous approaches, our procedure handles parameters and clocks in a unified way. We also study expressiveness questions for PolITA and show that PolITA are incomparable with stopwatch automata.



中文翻译:

多项式中断定时自动机:验证和表达

中断定时自动机(ITA)构成秒表自动机的子类,即使在存在参数的情况下,也可以确定可达性和定时模型检查的某些变体。它们非常适合于建模和分析实时操作系统。在这里,我们使用多项式保护和更新来扩展ITA,从而得出了多项式ITA(PolITA)的类。我们证明了在PolEX上的2EXPTIME中可到达性是可确定的,使用的是圆柱体代数分解算法对实数一阶理论的适应。我们还获得了定时版本CTL的模型检查以及在PolITA的多个扩展中的可达性的可判定性。。特别是,与以前的方法相比,我们的过程以统一的方式处理参数和时钟。我们还研究了PolITA的表现力问题,并表明PolITA与秒表自动机无法比拟。

更新日期:2020-04-01
down
wechat
bug