scholarly journals Precise Interval Analysis vs. Parity Games

Author(s):  
Thomas Gawlitza ◽  
Helmut Seidl
Materials ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2116
Author(s):  
Yue Xiao ◽  
Limin Tang ◽  
Jiawei Xie

There are great uncertainties in road design parameters, and the traditional point numerical calculation results cannot reflect the complexity of the actual project well. Additionally, the calculation method of road design theory based on interval analysis is more difficult in the use of uncertain design parameters. In order to simplify the calculation process of the interval parameters in the road design theory, the asphalt pavement design is taken as the analysis object, and the permanent deformation of the asphalt mixture is simplified by combining the interval analysis theory. Considering the uncertainty of the design parameters, the data with boundaries but uncertain size are expressed in intervals, and then the interval calculation formula for the permanent deformation of the asphalt mixture is derived, and the interval results are obtained. In order to avoid the dependence of interval calculation on the computer code, according to the interval calculation rule, the interval calculation method with the upper and lower end point values as point operations is proposed. In order to overcome the contradiction between interval expansion results and engineering applications, by splitting the multi-interval variable formulas, the interval variable weights are reasonably given, and the synthesis of each single interval result realizes a simplified calculation based on interval variable weight assignment. The analysis results show that the interval calculation method based on the point operation rule is accurate and reliable, and the simplified method based on the interval variable weight assignment is effective and feasible. The simplified interval calculation method proposed in this paper provides a reference for the interval application of road design theory.


2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.


2009 ◽  
Vol 208 (5) ◽  
pp. 755-761 ◽  
Author(s):  
William L. Holman ◽  
Walter E. Pae ◽  
Jeffrey J. Teutenberg ◽  
Michael A. Acker ◽  
David C. Naftel ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document