scientific article; zbMATH DE number 7453959

MaRDI QIDQ5020941zbMATH OpenFDO

Authors Bas Luttik

Publication date 7 January 2022

Full work available at URL https://arxiv.org/abs/2008.13355, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2020.2

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• “Sometimes” and “not never” revisited
• A calculus of communicating systems
• A complete axiomatisation for observational congruence of finite-state behaviours
• An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
• Axiomatising divergence
• Branching Bisimilarity with Explicit Divergence
• Branching time and abstraction in bisimulation semantics
• Comparing process calculi using encodings
• Computation tree logic with deadlock detection
• Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• scientific article; zbMATH DE number 4055005 (Why is no real title available?)
• scientific article; zbMATH DE number 1142329 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• scientific article; zbMATH DE number 7243676 (Why is no real title available?)
• Reactive Turing machines
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
• Sequential composition in the presence of intermediate termination (extended abstract)
• Three logics for branching bisimulation
• Up-to techniques for branching bisimilarity
• Using branching time temporal logic to synthesize synchronization skeletons
• When is partial trace equivalence adequate?

Cited in

(6)

• Next-preserving branching bisimulation
• On Bisimilarity and Substitution in Presence of Replication
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• Positive Hennessy-Milner logic for branching bisimulation
• Parallel pushdown automata and commutative context-free grammars in bisimulation semantics (extended abstract)

This page was built for publication:

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