scientific article; zbMATH DE number 1232243
From MaRDI portal
Publication:4223069
Recommendations
- Deciding bisimulation-like equivalences with finite-state processes
- Decidability of bisimilarity for one-counter processes.
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- Undecidability of weak bisimilarity for PA-processes
Cited in
(7)- A complete normal-form bisimilarity for state
- scientific article; zbMATH DE number 177261 (Why is no real title available?)
- Techniques for decidability and undecidability of bisimilarity
- Undecidability of weak bisimilarity for pushdown processes
- On the complexity of relational problems for finite state processes (extended abstract)
- Deciding bisimilarity between BPA and BPP processes.
- Deciding bisimulation-like equivalences with finite-state processes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223069)