In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent moves. He proved that weak bisimulation equivalence is a congruence for any process algebra defined by WB cool rules, and established similar results for rooted weak bisimulation (Milner’s “observational congruence”), branching bisimulation and rooted branching bisimulation. This study reformulates B...

By the technique of forcing, some new independence results are proved for the alternative set theory (AST) and similar weak theories: The scheme of choice is independent both of AST and of second order arithmetic, axiom of constructibility is independent of AST plus schemes of choice.

In this paper we introduce a definition of gradation of continuity ingraded fuzzy topological spaces and study its various characteristic properties.The impact of the grade of continuity of mappings over the N-compactnessgrade is examined. Concept of gradation is also introduced in openness, closed-ness, homeomorphic properties of mappings and T2 separation axiom. Effectof the grades interrelat...

Digital signal–processing (DSP) development tools such as Ptolemy, LabView and iConnect allow application developers to assemble reactive systems by connecting predefined components in generalised dataflow graphs and by hierarchically building new components by encapsulating sub–graphs. We follow the literature in calling this approach dataflow-oriented development. Previous work has shown how ...

This paper is a direct successor to Spescha and Strahm [12]. Its aim is to introduce a new realisability interpretation for weak systems of explicit mathematics and use it in order to analyze extensions of the theory PET in [12] by the so-called join axiom of explicit mathematics.

Digital signal–processing (DSP) development tools such as Ptolemy, LabView and iConnect allow application developers to assemble reactive systems by connecting predefined components in generalised dataflow graphs and by hierarchically building new components by encapsulating sub–graphs. We follow the literature in calling this approach dataflow-oriented development. Previous work has shown how ...

Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric failure equivalences, which take two previously-known behavioral equivalences, i.e., the weak failure equivalence and the weak impossible future equivalence, as thei...

stability and structural change of iranian consumers' preference for tea commodities during 1988-2005 is investigated throughout the coarse of this study. to this end, nonparametric test of revealed preference has been utilized. results of weak axiom of revealed preference (warp) show that in 1995 a contradiction has been in observed consumers' preference for tea with the null hypothe...

We show how to apply Howe’s method for the proof of congruence of early bisimilarities in a higher-order process calculus with passivation. This involves the introduction of a proof technique based on a new kind of transition system and bisimilarity, called complementary semantics. We show that complementary semantics is equivalent to contextual semantics, originally introduced by Sangiorgi, th...