### Abstract

This paper proposes an inductive synthesis algorithm for a recursive process. To synthesize a process, facts, which must be satisfied by the target process, are given to the algorithm one by one since such facts are infinitely many in general. When n facts are input to the algorithm, it outputs a process which satisfies the given n facts. And this generating process is repeated infinitely many times. To represent facts of a process, we adopt a subcalculus of μ-calculus. First, we introduce a new preorder ≤_{d} on recursive processes based on the subcalculus to discuss its properties. p ≤ _{d} q means that p |= f implies q |= f, for all formulae f in the subcalculus. Then, its discriminative power and relationship with other preorders are also discussed. Finally, we present the synthesis algorithm. The correctness of the algorithm can be stated that the output sequence of processes by the algorithm converges to a process, which cannot be distinguished from the intended one (if we could know it) by a given enumeration of facts, in the limit. A prototype system based on the algorithm is stated as well.

Original language | English |
---|---|

Pages (from-to) | 257-284 |

Number of pages | 28 |

Journal | Information and Computation |

Volume | 163 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2000 |

### ASJC Scopus subject areas

- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Inductive synthesis of recursive processes from logical properties'. Together they form a unique fingerprint.

## Cite this

*Information and Computation*,

*163*(2), 257-284. https://doi.org/10.1006/inco.2000.2883