Skip to main content

4 Result(s)

within Chaodong He Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Branching Bisimilarity Checking for PRS

    Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any othe...

    Qiang Yin, Yuxi Fu, Chaodong He, Mingzhang Huang… in Automata, Languages, and Programming (2014)

  2. No Access

    Chapter and Conference Paper

    Decidability of Behavioral Equivalences in Process Calculi with Name Sco**

    Local channels and their name sco** rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS...

    Chaodong He, Yuxi Fu, Hongfei Fu in Fundamentals of Software Engineering (2012)

  3. No Access

    Chapter and Conference Paper

    The Decidability of the Reachability Problem for CCS!

    CCS! is a variant of CCS in which infinite behaviors are defined by the replication operator. We show that the reachability problem for CCS! is decidable by a reduction to the same problem for Petri Nets.

    Chaodong He in CONCUR 2011 – Concurrency Theory (2011)

  4. No Access

    Chapter and Conference Paper

    Model Independent Order Relations for Processes

    Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially on the observational behavio...

    Chaodong He in Programming Languages and Systems (2010)