Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes

Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota. Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. In Joost-Pieter Katoen, Barbara König, editors, CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings. Volume 6901 of Lecture Notes in Computer Science, pages 528-542, Springer, 2011. [doi]

@inproceedings{CzerwinskiHL11,
  title = {Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes},
  author = {Wojciech Czerwinski and Piotr Hofman and Slawomir Lasota},
  year = {2011},
  doi = {10.1007/978-3-642-23217-6_35},
  url = {http://dx.doi.org/10.1007/978-3-642-23217-6_35},
  tags = {context-aware},
  researchr = {https://researchr.org/publication/CzerwinskiHL11},
  cites = {0},
  citedby = {0},
  pages = {528-542},
  booktitle = {CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  editor = {Joost-Pieter Katoen and Barbara König},
  volume = {6901},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-23216-9},
}