Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity

DOI10.4230/LIPIcs.CALCO.2019.11OpenAlexW2972270955MaRDI QIDQ5875352

Bas Luttik, Astrid Belder, Jos C. M. Baeten

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/lipics.calco.2019.11

zbMATH Keywords

sequencingdecidabilityaxiomatisationsequential compositionbisimilarity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive Turing machines
• Transition system specifications with negative premises
• When is partial trace equivalence adequate?
• The algebra of communicating processes with empty process
• The meaning of negative premises in transition system specifications. II
• Bisimulation equivalence is decidable for all context-free processes
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• Partial Derivatives for Context-Free Languages
• A Process-Theoretic Look at Automata
• A Context-Free Process as a Pushdown Automaton
• Process algebra for synchronous communication
• Termination, deadlock, and divergence
• The meaning of negative premises in transition system specifications
• Enhancements of the bisimulation proof method
• Infinite results