1. A theory of timed automata;Alur;Theoretical Computer Science,1994
2. Deciding bisimilarity is p-complete;Balcázar;Formal Aspects of Computing,1992
3. Alternation;Chandra;Journal of the ACM,1981
4. On the complexity of verifying concurrent transition systems;Kupferman,1997
5. Verification of parallel systems via decomposition;Groote,1992