LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 385-387 of 486

    • A Near-optimal Method for Reasoning About Action 

      Pratt, Vaughan R. (1978-09)
      We give an algorithm for "before-after" reasoning about action. The algorithm decides satisfiability and validity of formulae of propositional dynamic logic, a recently developed logic of change of state that subsumes the ...

    • A Decidability Result for a Second Order Process Logic 

      Parikh, Rohit (1978-09)
      We prove the decidability of the validity problem for a rather general language for talking about computations. As corollaries of our result, we obtain some decidability results of Pratt, Constable, Fischer-Ladner, and ...

    • Bounds on the Scheduling of Types Task Systems 

      Jaffe, Jeffrey M. (1978-09)
      We study the scheduling of different types of tasks on different types of processors. If there are k types of tasks and mi identifical processors for takss of type I, the finishing times of any demand driven or list schedule ...