Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE

Examines "program adjustment", a formal and practical approach to developing correct concurrent programs, by automatically adjusting an imperfect program to satisfy given constraints. A concurrent program is modeled by a finite-state process, and program adjustment to satisfy temporal logic constraints is formalized as the synthesis of an arbiter process which partially serializes target (i.e. imperfect) processes to remove harmful nondeterministic behaviors. Compositional adjustment is also proposed for large-scale compound target processes, using process equivalence theory. We have developed a programming environment on the parallel computer Multi-PSI, called MENDELS ZONE, that adopts this compositional adjustment. The target concurrent programming language, MENDEL, is based on a high-level Petri net. Adjusted programs can be compiled into the kernel language KL1 and executed on Multi-PSI.<<ETX>>

[1]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[2]  Shinichi Honiden,et al.  An Application of Artifical Intelligence to Prototyping Process in Performance Design for Real-time Systems , 1991, ESEC.

[3]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[4]  Kazunori Matsumoto,et al.  MENDELS: Concurrent Program Synthesis System Using Temporal Logic , 1987, LP.

[5]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[6]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[7]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[8]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Hiroyuki Sato,et al.  Overview of the Parallel Inference Machine Operating System (PIMOS) , 1988, FGCS.

[10]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[11]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

[12]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

[13]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[14]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[15]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[16]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[17]  Akihiko Ohsuga,et al.  An integration environment to put formal specifications into practical use in real-time systems , 1991, Proceedings of the Sixth International Workshop on Software Specification and Design.

[18]  Kazunori Matsumoto,et al.  Synthesis of concurrent programs: automated reasoning complements software reuse , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.