Foundations of Software Science and Computation Structures

DOI10.1007/11690634zbMATH Open1180.68188OpenAlexW2504714231MaRDI QIDQ5899080FDOQ5899080

Zining Cao

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11690634

Recommendations

• More on bisimulations for higher order \(\pi\)-calculus
• Bisimulation for higher-order process calculi
• First-order reasoning for higher-order concurrency
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Bisimulations for a Distributed Higher Order π-Calculus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (14)

• Equivalence Checking for a Finite Higher Order π-Calculus
• Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
• Title not available (Why is that?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• More on bisimulations for higher order \(\pi\)-calculus
• On the expressiveness and decidability of higher-order process calculi
• Characterizing contextual equivalence in calculi with passivation
• Bisimulations for a Distributed Higher Order π-Calculus
• HOCore in Coq
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
• Normal Bisimulations in Calculi with Passivation
• More SPASS with Isabelle
• A Logic for Distributed Higher Order π-Calculus

This page was built for publication: Foundations of Software Science and Computation Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899080)