HIGHLIGHTS
- who: Jan Martens from the Eindhoven University of Technology, De Groene Loper, Eindhoven , AE, The Netherlands have published the research work: Linear parallel algorithms to compute strong and branching bisimilarity, in the Journal: (JOURNAL)
- what: The authors propose two such algorithms to decide strong and branching bisimilarity. As labelled transition systems (LTSs) are commonly used, and labels are not straightforward to incorporate in an efficient way (cf. for instance ), the authors discuss how to extend the algorithm to take action labels into account. The authors demonstrate this by translating the PRAM algorithm to GPU code . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.