Towards a theory of simultaneous actions

  • Gerd Große
  • Richard Waldinger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 522)


We will lay down a model of concurrency for planning problems. The model will be expressive enough for representing real simultaneity of primitive actions without getting too complicated for the plan synthesis process. The model will be described in detail and its use in respect to the synthesis of terminating plans is demonstrated in an example.

Key words and phrases

Plan synthesis concurrency theorem proving situational logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A 84]
    J.F. Allen. Towards a General Theory of Action and Time, AI Journal 23, 1984Google Scholar
  2. [CE 81]
    E.M. Clarke, E.A. Emerson. Design and Synthesis of Synchronization Skeletons from Branching-Time Temporal Logic, Logics of Programs, Springer LNCS 131, 1981Google Scholar
  3. [G 87a]
    M.P. Georgeff. Actions, Processes, and Causality, Tech. Note 404, SRI International, 1987Google Scholar
  4. [G 87b]
    M.P. Georgeff. Many Agents are better than one, Tech. Note 417, SRI International, 1987Google Scholar
  5. [H 78]
    C.A.R. Hoare. Communicating Sequential Processes, CACM, 1978Google Scholar
  6. [Mi 80]
    R. Milner. A Calculus of Communicating Systems, Springer LNCS 92, 1980Google Scholar
  7. [MW 80]
    Z. Manna, R. Waldinger. A Deductive Approach to Program Synthesis, ACM Transactions on Programming Languages and Systems, 1980Google Scholar
  8. [MW 87]
    Z. Manna, R. Waldinger. How to Clear a Block, J. o. Automated Reasoning, 1987Google Scholar
  9. [MWo 84]
    Z. Manna, P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications, ACM Transactions on Programming Languages and Systems, 1984Google Scholar
  10. [Pel 88]
    R.N. Pelavin. A Formal Approach to Planning with Concurrent Actions and External Events, Ph.D. thesis, University of Rochester, New York, 1988Google Scholar
  11. [Ped 86]
    E. Pednault. Formulating Multiagent, Dynamic-World Problems in the Classical Planning Framework, Proceedings of the Workshop ‘Reasoning about Actions and Plans’, Georgeff and Lansky (eds.), 1986Google Scholar
  12. [Pr 86]
    V.R. Pratt. Modeling Concurrency with Partial Orders, Int. J. Parallel Programming, 1986Google Scholar
  13. [R 85]
    W. Reisig. Petri Nets: An Introduction, Springer, 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Gerd Große
    • 1
  • Richard Waldinger
    • 2
  1. 1.FG IntellektikTH DarmstadtDarmstadtGermany
  2. 2.Artificial Intelligence CenterSRI InternationalMenlo ParkUSA

Personalised recommendations