scientific article; zbMATH DE number 7441255

zbMath1483.68221arXiv1709.02440MaRDI QIDQ5014795

Fei Yang, Bas Luttik, Jos C. M. Baeten

Publication date: 8 December 2021

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

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

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)

Related Items

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive Turing machines
• When is partial trace equivalence adequate?
• The meaning of negative premises in transition system specifications. II
• Turing Meets Milner
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• Decidability of bisimulation equivalence for process generating context-free languages
• On the Executability of Interactive Computation
• 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
• Termination, deadlock, and divergence
• Divide and congruence III: Stability & divergence
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Non-regular iterators in process algebra
• Infinite results