Compositional Synthesis of Generalized Mealy Machines

Authors:
Simone Tini;Andrea Maggiolo-Schettini
Affiliations:
Dipartimento di Scienze della Cultura, Politiche e dell'Informazione, Università dell'Insubria, Via Valleggio 11, 22100 Como, Italy;Dipartimento di Informatica, Università di Pisa, Via Buonarroti 2, 56127 Pisa, Italy
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Year:
2004

Citing 9
Cited 0

On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the development of reactive systems

Logics and models of concurrent systems
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Synthesis of concurrent systems for an atomic read/atomic write model of computation

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Synthesis of fault-tolerant concurrent programs

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Synthesis of Communicating Processes from Temporal Logic Specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing automata from temporal logic formulas: a tutorial

Lectures on formal methods and performance analysis
Realizable and Unrealizable Specifications of Reactive Systems

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Synthesis of an Asynchronous Reactive Module

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an algorithm for synthesizing Generalized Mealy Machines from LTL-formulae. The main novelty of the paper is that the algorithm is compositional. Its complexity coincides with the lower bound of the synthesis problem.