The Experts below are selected from a list of 3030 Experts worldwide ranked by ideXlab platform

Tini S. - One of the best experts on this subject based on the ideXlab platform.

  • Probabilistic divide & Congruence: Branching bisimilarity
    'Elsevier BV', 2020
    Co-Authors: Tini S.
    Abstract:

    Since the seminal paper by Bloom, Fokkink and van Glabbeek, the Divide and Congruence technique allows for the derivation of compositional properties of nondeterministic processes from the SOS-based decomposition of their modal properties. In an earlier paper, we extended their technique to deal also with quantitative aspects of process behavior: we proved the (pre)Congruence Property for strong (bi)simulations on processes with nondeterminism and probability. In this paper we further extend our decomposition method to favor compositional reasoning with respect to probabilistic weak semantics. In detail, we consider probabilistic branching and rooted probabilistic branching bisimilarity, and we propose logical characterizations for them. These are strongly based on the modal operator (epsilon) which combines quantitative information and weak semantics by introducing a sort of probabilistic lookahead on process behavior. Our enhanced method will exploit distribution specifications, an SOS-like framework defining the probabilistic behavior of processes, to decompose this particular form of lookahead. We will show how we can apply the proposed decomposition method to derive Congruence formats for the considered equivalences from their logical characterizations. (C) 2019 Elsevier B.V. All rights reserved

  • Probabilistic divide & Congruence: Branching bisimilarity
    'Elsevier BV', 2020
    Co-Authors: Tini S.
    Abstract:

    Since the seminal paper by Bloom, Fokkink and van Glabbeek, the Divide and Congruence technique allows for the derivation of compositional properties of nondeterministic processes from the SOS-based decomposition of their modal properties. In an earlier paper, we extended their technique to deal also with quantitative aspects of process behavior: we proved the (pre)Congruence Property for strong (bi)simulations on processes with nondeterminism and probability. In this paper we further extend our decomposition method to favor compositional reasoning with respect to probabilistic weak semantics. In detail, we consider probabilistic branching and rooted probabilistic branching bisimilarity, and we propose logical characterizations for them. These are strongly based on the modal operator (epsilon) which combines quantitative information and weak semantics by introducing a sort of probabilistic lookahead on process behavior. Our enhanced method will exploit distribution specifications, an SOS-like framework defining the probabilistic behavior of processes, to decompose this particular form of lookahead. We will show how we can apply the proposed decomposition method to derive Congruence formats for the considered equivalences from their logical characterizations. (C) 2019 Elsevier B.V. All rights reserved

Li Ren - One of the best experts on this subject based on the ideXlab platform.

  • Congruence Property in orbifold theory
    arXiv: Quantum Algebra, 2016
    Co-Authors: Chongying Dong, Li Ren
    Abstract:

    Let $V$ be a rational, selfdual, $C_2$-cofinite vertex operator algebra of CFT type, and $G$ a finite automorphism group of $V.$ It is proved that the kernel of the representation of the modular group on twisted conformal blocks associated to $V$ and $G$ is a Congruence subgroup. In particular, the $q$-character of each irreducible twisted module is a modular function on the same Congruence subgroup. In the case $V$ is the Frenkel-Lepowsky-Meurman's moonshine vertex operator algebra and $G$ is the monster simple group, the generalized McKay-Thompson series associated to any commuting pair in the monster group is a modular function.

  • Congruence Property in Orbifold Theory
    2016
    Co-Authors: Dong Chongying, Li Ren
    Abstract:

    Let $V$ be a rational, selfdual, $C_2$-cofinite vertex operator algebra of CFT type, and $G$ a finite automorphism group of $V.$ It is proved that the kernel of the representation of the modular group on twisted conformal blocks associated to $V$ and $G$ is a Congruence subgroup. In particular, the $q$-character of each irreducible twisted module is a modular function on the same Congruence subgroup. In the case $V$ is the Frenkel-Lepowsky-Meurman's moonshine vertex operator algebra and $G$ is the monster simple group, the generalized McKay-Thompson series associated to any commuting pair in the monster group is a modular function.Comment: 11 page

Nicholas Phat Nguyen - One of the best experts on this subject based on the ideXlab platform.

Nguyen, Nicholas Phat - One of the best experts on this subject based on the ideXlab platform.

Jan Friso Groote - One of the best experts on this subject based on the ideXlab platform.

  • Congruence for SOS with data Congruence for SOS with Data
    2020
    Co-Authors: Mohammad Reza Mousavi, Michel Reniers, Jan Friso Groote
    Abstract:

    Abstract While studying the specification of the operational semantics of different programming languages and formalisms, one can observe the following three facts. Firstly, Plotkin's style of Structured Operational Semantics (SOS) has become a standard in defining operational semantics. Secondly, Congruence with respect to some notion of bisimilarity is an interesting Property for such languages and it is essential in reasoning about them. Thirdly, there are numerous languages that contain an explicit data part in the state of the operational semantics. The first two facts, have resulted in a line of research exploring syntactic formats of operational rules to derive the desired Congruence Property for free. However, the third point (in combination with the first two) is not sufficiently addressed and there is no standard Congruence format for operational semantics with an explicit data state. In this paper, we address this problem by studying the implications of the presence of a data state on the notion of bisimilarity. Furthermore, we propose a number of formats for Congruence

  • notions of bisimulation and Congruence formats for sos with data
    Information & Computation, 2005
    Co-Authors: Mohammad Reza Mousavi, Michel A Reniers, Jan Friso Groote
    Abstract:

    While studying the specification of the operational semantics of different programming languages and formalisms, one can observe the following three facts. First, Plotkin's style of Structural Operational Semantics has become a standard in defining operational semantics. Second, Congruence with respect to some notion of bisimilarity is an interesting Property for such languages and it is essential in reasoning. Third, there are numerous languages that contain an explicit data part in the state of the operational semantics. The first two facts have resulted in a line of research exploring syntactic formats of operational rules to derive the desired Congruence Property for free. However, the third point (in combination with the first two) is not sufficiently addressed and there is no standard Congruence format for operational semantics with an explicit data state. In this article, we address this problem by studying the implications of the presence of a data state on the notion of bisimilarity. Furthermore, we propose a number of formats for Congruence.