scientific article; zbMATH DE number 7327947

MaRDI QIDQ5856418

Bas Luttik, Fei Yang

Publication date: 26 March 2021

Full work available at URL: https://arxiv.org/abs/1410.4512

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(\pi\)-calculusabsolute expressiveness of process calculibehavioural completenessdivergence-preserving branching bisimilarityorbit-finite executabilityreactive Turing machine

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

A thesis for interaction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive Turing machines
• A new approach to abstract syntax with variable binding
• On the expressiveness of interaction
• On the consistency of Koomen's fair abstraction rule
• Branching bisimilarity is an equivalence indeed!
• Towards a unified approach to encodability and separation results for process calculi
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• Branching Bisimilarity with Explicit Divergence
• A Process-Theoretic Look at Automata
• Computation Tree Logic with Deadlock Detection
• A Context-Free Process as a Pushdown Automaton
• A characterization of regular expressions under bisimulation
• Functions as processes
• Branching time and abstraction in bisimulation semantics
• Turing Machines with Atoms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
• Non-regular iterators in process algebra

This page was built for publication: