Shmuel Katz and Doron Peled. An efficient verification method for parallel and distributed programs. In Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, number 354 in LNCS, pages 489-507, Noordwijkerhout, The Netherlands, 1988. Springer-Verlag.
Doron Peled and Amir Pnueli. Proving partial order liveness properties. In M. S. Paterson, editor, Proceedings ICALP '90, number 443 in LNCS, pages 553-571, Warwick University, England, 1990. Springer-Verlag.
Shmuel Katz and Doron Peled. Interleaving set temporal logic. Theoretical Computer Science, 75(3):21-43, 1991. Preliminary versions appeared in 6th Annual ACM Symposium on Distributed Computing 1987, and in LNCS 398, Temporal Logic in Specification, 1988.
Doron Peled, Shmuel Katz, and Amir Pnueli. Specifying and proving serializability in temporal logic. In IEEE Symposium on Logic in Computer Science, pages 232-244, Amsterdam, The Netherlands, 1991.
Shmuel Katz and Doron Peled. Defining conditional independence using collapses. Theoretical Computer Science, 101:337-359, 1992. A preliminary version appeared in Semantics for Concurrency, Workshop in Computing Series, Springer-Verlag, 1990, 262-280.
Shmuel Katz and Doron Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6:107-120, 1992.
Doron Peled. Sometimes ``some'' is as good as ``all''. In 3rd International Conference on Concurrency Theory, number 630 in LNCS, pages 192-206, Stony Brook NY, USA, 1992. Springer-Verlag.
Doron Peled. All from one, one from all: on model checking using representatives. In 5th International Conference on Computer Aided Verification, Greece, number 697 in LNCS, pages 409-423, Elounda Crete, Greece, 1993. Springer-Verlag.
Gerard J. Holzmann and Doron Peled. An improvement in formal verification. In Formal Description Techniques 1994, pages 197-211, Bern, Switzerland, 1994. Chapman & Hall.
Marta Kwiatkowska, Doron Peled, and Wojciech Penczek. A hierarchy of partial order temporal properties. In Temporal Logic, ICTL'94, number 827 in LNCS, pages 398-414, Bonn, Germany, 1994. Springer-Verlag.
Doron Peled. On projective and separable properties. In Colloquium on Trees in Algebra and Programming, number 787 in LNCS, pages 291-307, Edinburgh, Scotland, 1994. Springer-Verlag.
Doron Peled and Mathai Joseph. A compositional framework for fault tolerance by specification transformation. Theoretical Computer Science, 128:99-125, 1994. A preliminary version appeared in 5th International PARLE (Parallel Architectures and Languages Europe), 1993, LNCS 694, Springer-Verlag, 173-184.
Doron Peled and Amir Pnueli. Proving partial order properties. Theoretical Computer Science, 126:143-182, 1994.
Rajeev Alur, Doron Peled, and Wojciech Penczek. Model-checking of causality properties. In 10th Symposium on Logic in Computer Science, San Diego, Californa, USA, 1995. IEEE.
Rob Gerth, Ruurd Kuiper, Doron Peled, and Wojciech Penczek. A partial order approach to branching time logic model checking. In Third Israel Symposium on Theory on Computing and Systems, pages 130-139, Tel Aviv, Israel, 1995. IEEE.
Rob Gerth, Doron Peled, Moshe Vardi, and Pierre Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
Gerard Holzmann and Doron Peled. Checking linear temporal lgoic properties. In First SPIN Workshop, Montrèal, Quebec, 1995. A position paper.
Gerard Holzmann and Doron Peled. Partial order reduction of the state space. In First SPIN Workshop, Montrèal, Quebec, 1995. A position paper.
Doron Peled. Book review: Temporal logic, mathematical foundations and computational aspects, by gabbay, hodkinson and reinolds. The Computer Journal, 38 (3), 1995.
Doron Peled and Wojciech Penczek. Using asynchronous buchi automata for efficient model-checking of concurrent systems. In Protocol Specification Testing and Verification, pages 90-100, Warsaw, Poland, 1995. Chapman & Hall.
Rajeev Alur, Gerard Holzmann, and Doron Peled. An analyzer for message sequence charts. Software: Concepts and Tools, 17:70-77, 1996. also appeared in TACAS'96, Tools and Algorithms for the Construction and Analysis of Systems, Passau, Germany, LNCS 1055, Springer-Verlag, 1996, 35-48.
Rajeev Alur, Ken McMillan, and Doron Peled. Model checking for correctness conditions of concurrent objects. In 11th Symposium on Logic in Computer Science, pages 219-228, New Brunswick, NJ, USA, 1996. IEEE.
Ching-Tsun Chou and Doron Peled. Verifying a model-checking algorithm. In Tools and Algorithms for the Construction and Analysis of Systems, number 1055 in LNCS, pages 241-257, Passau, Germany, 1996. Springer-Verlag.
Patrice Godefroid, Doron Peled, and Mark Staskauskas. Using partial order methods in the formal validation of industrial concurrent programs. IEEE, Transactions on Software Engineerings, 22:496-507, 1996. A preliminary version appeared in ISSTA'96, International Symposium on Software Testing and Analysis, ACM Press, San Diego, California, USA, 1996, 261-269.
Gerard Holzmann, Doron Peled, and Mihalis Yannakakis. On nested depth first search. In Second SPIN Workshop, Rutgers, Piscataway, NJ, 1996. AMS. to appear early 1997.
Gerard J. Holzmann and Doron Peled. The state of spin. In 8th International Conference on Computer Aided Verification, number 1102 in LNCS, pages 385-389, New Brunswick, NJ, USA, 1996. Springer Verlag.
Doron Peled. Combining partial order reductions with on-the-fly model-checking. Journal of Formal Methods in Systems Design, 8 (1):39-64, 1996. also appeared in 6th International Conference on Computer Aided Verification 1994, Stanford CA, USA, LNCS 818, Springer-Verlag, 377-390.
Doron Peled. Partial order reduction: Linear and branching temporal logics and process algebras. In Partial Orders Methods in Verification, DIMACS, Princeton, NJ, USA, 1996. American Mathematical Society.
Doron Peled. Partial order reduction: Model-checking using representatives. In 21st International Symposium on Mathematical Foundations of Computing Science, number 1113 in LNCS, pages 93-112, Cracow, Poland, 1996. Springer Verlag.
Doron Peled, Thomas Wilke, and Pierre Wolper. An algorithmic approach for checking closure properties of $\omega$-regular languages. In CONCUR'96, 7th International Conference on Concurrency Theory, number 1119 in LNCS, pages 596-610, Pisa, Italy, 1996. Springer Verlag.
E. Allen Emerson, Somesh Jha, and Doron Peled. Combining partial order and symmetry reduction. In TACAS'97, Tools and Algorithms for the Construction and Analysis of Systems, LNCS, Enschede, The Netherlands, 1997. Springer. to appear.
Vladimir Levin and Doron Peled. Verification of message sequence charts via template matching. In TAPSOFT (FASE)'97, Theory and Practice of Software Development, LNCS, Lille, France, 1997. Springer. to appear.