bibliography kousha



  1. K. Etessami and Th. Wilke and R. A. Schuller, Fair simulation relations parity games and state space reduction for B u chi automata, 2001, (To appear in em Proc. of 28th Int. Col. on Automata Languages and Programming (ICALP 2001)) .
  2. R. Alur and K. Etessami and M. Yannakakis, Analysis of Recursive State machines, 2001, (To appear in em Proc. of 13th Conf. on Computer-Aided Verification (CAV 2001)) .
  3. R. Alur and K. Etessami and M. Yannakakis, Realizability and Verification of MSC graphs, 2001, (To appear in em Proc. of 28th Int. Col. on Automata Languages and Programming (ICALP 2001)) .
  4. K. Etessami and M. Yannakakis, From Rule-based to Automata-based testing, Proceedings of FORTE PSTV 2000 20th IFIP Int. Conf. on Formal Description Techniques Protocol Specification Testing and Verification, 2000.
  5. K. Etessami and G. Holzmann, Optimizing B u chi Automata, Proceedings of 11th Int. Conf. on Concurrency Theory (CONCUR), 2000.
  6. R. Alur and K. Etessami and M. Yannakakis, Inference of Message Sequence Charts, 22nd International Conference on Software Engineering, 2000.
  7. K. Etessami, A note on a question of P eled and W ilke on stutter-invariant LTL, Information Processing Letters, Vol. 75, 6, pp. 261-263, 2000.
  8. R. Alur and K. Etessami and D. Peled and S. LaTorre, Parametric Temporal Logic for Model Measuring, 26th International Colloqium on Automata Languages and Programming (ICALP 99), pp. 159-168, 1999.
  9. K. Etessami, Stutter-invariant Languages omega -automata and temporal logic, CAV 99: Computer Aided Verification 11th International Conference, pp. 236-248, 1999.
  10. K. Etessami, Dynamic Tree Isomorphism via First-Order Updates to a Relational Database, Symposium on Principles of Database Systems, 1998.
  11. K. Etessami and M. Y. Vardi and T. Wilke, First-Order Logic with Two Variables and Unary Temporal Logic, 12th IEEE symposium on Logic in Computer Science, 1997, (Journal version to appear in special issue of Information and Computation for LICS 97.) .
  12. K. Etessami, An Until Hierarchy and other applications for an Ehrenfeucht-Fra i sse Game for Temporal Logic, Information and Computation, Vol. 160, 1 2, pp. 88-108, 2000, (Conference version appeared in em Proc. 11th IEEE Symp. on Logic in Computer Science 1996) .
  13. K. Etessami and N. Immerman, Tree Canonization and Transitive Closure, Information and Computation, Vol. 157, 1 2, pp. 227-260, 2000, (Conference version appeared in em 10th IEEE symposium on Logic in Computer Science 1995) .
  14. K. Etessami, Counting Quantifiers Successor Relations and Logarithmic Space, Journal of Computer and System Sciences, Vol. 54, 3, pp. 400-411, June 1997, (Special issue for the 10th IEEE Structure in Complexity Theory Conference 1995) .
  15. K. Etessami and N. Immerman, Reachability and the Power of Local Ordering, Theoretical Computer Science, Vol. 148, 2, pp. 261-279, 1995, (Special issue for STACS 94: syposium on theoretical aspects of computer science.) .

Go to the Computing Sciences Research Center home page.
Modified: December, 1997.
Copyright © 1997 Lucent Technologies. All rights reserved.