Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
From MaRDI portal
Publication:5875352
DOI10.4230/LIPICS.CALCO.2019.11OpenAlexW2972270955MaRDI QIDQ5875352FDOQ5875352
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
Cites Work
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Verification on infinite structures.
- Termination, deadlock, and divergence
- Enhancements of the bisimulation proof method
- The meaning of negative premises in transition system specifications. II
- The algebra of communicating processes with empty process
- A process-theoretic look at automata
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Reactive Turing machines
- Bisimulation equivalence is decidable for all context-free processes
- The meaning of negative premises in transition system specifications
- Infinite results
- Transition system specifications with negative premises
- Title not available (Why is that?)
- Title not available (Why is that?)
- When is partial trace equivalence adequate?
- Partial derivatives for context-free languages. From \(\mu\)-regular expressions to pushdown automata
- Expressiveness modulo bisimilarity of regular expressions with parallel composition
- Sequential composition in the presence of intermediate termination (extended abstract)
- A Context-Free Process as a Pushdown Automaton
Cited In (3)
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)
