Basic process algebra with deadlocking states
Theoretical Computer Science
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Undecidable equivalences for basic parallel processes
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
| Hi-index | 0.00 |