摘要基于μ 演算的一阶谓词界程逻辑, 用谓词变量构造不动点公式, 方便描述闭环系统的性质,
公式语义简洁. 该逻辑在有限控制移动界程上的模型检测目前性能最好的算法的时间复杂度与 …

La vérification formelle est indispensable pour assurer la fiabilité des applications
complexes et critiques comme les protocoles de télécommunication et les systèmes répartis …

Model checking of logical models is establishing whether a formula is satisfied in a model
under certain conditions. Logical models are the groundwork of many software protocols …

Various model-checking algorithms for the alternation-free subset of the modal mu-calculus
are considered. The algorithms are based on a data structure called the product graph …

In this paper, we report experiments we did with the constraint languageToupie. Toupie is a
finite-domain µ-calculus interpreter. In additionto classical functionalities of a finite-domain …

Categorical studies of recursive data structures and their associated reasoning principles
have mostly focused on two extremes: initial algebras and induction, and final coalgebras …

Retrieval engines provide results according to user request. Nevertheless, reaching
satisfaction can not be guaranteed with simple retrieval step. Therefore, it is necessary to …

The synchronous model of computation requires that in every step, inputs are read and
outputs are synchronously computed as the reaction of the program. In addition, all internal …

Notions of simulation, among other uses, provide a computationally tractable and sound (but
not necessarily complete) proof method for language inclusion. They have been …

Durational transition systems are finite transition systems where every transition is
additionally equipped with a duration. We consider the problem of interpreting/spl mu …