Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity

DOI10.4230/LIPICS.CALCO.2019.11MaRDI QIDQ5875352zbMATH OpenOpenAlexFDO

Authors Astrid Belder, Bas Luttik, 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

decidabilitysequencingsequential compositionaxiomatisationbisimilarity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Sequential composition in the presence of intermediate termination (extended abstract)
• Complexity of checking bisimilarity between sequential and parallel processes
• scientific article; zbMATH DE number 7471704
• The Saga of the Axiomatization of Parallel Composition
• Termination, deadlock, and divergence

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 408802 (Why is no real title available?)
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• A Context-Free Process as a Pushdown Automaton
• A process-theoretic look at automata
• Bisimulation equivalence is decidable for all context-free processes
• Enhancements of the bisimulation proof method
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• Infinite results
• Partial derivatives for context-free languages. From \(\mu\)-regular expressions to pushdown automata
• Process algebra for synchronous communication
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Reactive Turing machines
• Sequential composition in the presence of intermediate termination (extended abstract)
• Termination, deadlock, and divergence
• The algebra of communicating processes with empty process
• The meaning of negative premises in transition system specifications
• The meaning of negative premises in transition system specifications. II
• Transition system specifications with negative premises
• Verification on infinite structures.
• When is partial trace equivalence adequate?

Cited in

(3)

• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• scientific article; zbMATH DE number 7453959 (Why is no real title available?)

This page was built for publication: Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity

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