This paper shows how downward simulation can be checked using existing temporal logic model checkers. In particular, we show how the branching time temporal logic CTL can be used to encode the standard downward simulation conditions. We do this for both a blocking, or guarded, interpretation of operations (often used when specifying reactive systems) as well as the more common non-blocking inte...

The results of this paper were obtained independently by the two authors and appeared in their Ph.D. theses [7, 20]. A preliminary version with the title was presented by the rst author at the Conference of Structure in Complexity Theory 1994 [6]. Im Neuenheimer Feld 294, 69120 Heidelberg, Germany, email: [email protected] Dipartimento di Scienze dell'Informazione, Via Salaria 113, 0019...

This paper examines downward price rigidity in Iranian house market and discusses whether this characteristic would result in an asymmetric relationship between house price and monetary policy. To test the downward house price rigidity the threshold GARCH model is employed. The asymmetric adjustment to monetary policy is examined using the asymmetric cointegration and error correction models. T...

OBJECTIVES In China, the rate of downward referral is relatively low, as most people are unwilling to be referred from hospitals to community health systems (CHSs). The aim of this study was to explore the effect of doctors' and patients' practices and attitudes on their willingness for downward referral and the relationship between downward referral and sociodemographic characteristics. METH...

The next version to excite attention took off from the idea that, while mental terms cannot be translated into physical terms (as Carnap’s program had required) nevertheless, it does not follow that these terms refer to non-physical states. So, it was proposed, mental phenomena can be identical with states and processes in the brain, even though psychological descriptions have meanings differen...

A 2-directional orthogonal ray graph is an intersection graph of rightward rays (half-lines) and downward rays in the plane. We show a dynamic programming algorithm that solves the weighted dominating set problem in O(n3) time for 2-directional orthogonal ray graphs, where n is the number of vertices of a graph. key words: Boolean-width, dominating set, dynamic programming, twodirectional ortho...

y Abstract. Recently, a technique was presented for using pre-interpretations for abstract interpretation of the correct answer set CP of a logic program P. So far it was an open problem whether pre-interpretations could also be used for deriving non-downward closed properties of the computed answer set OP such as deenite freeness. This paper shows that it is possible to do so.