Article

Free access

On the synthesis of a reactive module

Authors:

R. RosnerAuthors Info & Claims

POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 179 - 190

https://doi.org/10.1145/75277.75293

Published: 03 January 1989 Publication History

Abstract

We consider the synthesis of a reactive module with input x and output y, which is specified by the linear temporal formula @@@@(x, y). We show that there exists a program satisfying @@@@ iff the branching time formula (∀x) (∃y) A@@@@(x, y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm for constructing the program whenever it exists. The algorithm is based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in the number of states. This leads to a synthesis algorithm whose complexity is double exponential in the length of the given specification.

References

[1]

J. Bacon, Substance and first-order quantification over individual-concepts, J. Symb. Logic 45, 1980, pp. 193-203.

[2]

J.R. B Schi and L.H. Landweber, Solving sequential conditions by finite-state strategies, Trans. Amer. Math. Soc. 138, 1969, pp. 295-311.

[3]

E.M. Clarke and E.A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Proc. IBM Workshop ca Logic8 of Programs, Lec. Notes in Comp. Sci. 131, Springer, 1981, pp. 52-71.

Digital Library

[4]

E.M. Clarke, E.A. Emerson, and A.P. Sistla, Automatic verification of finite state concurrent systems using temporal logic specifications, A CM Trans. Prog. Lang. Syst. 8, 1986, pp. 244-263.

Digital Library

[5]

A. Church, Logic, arithmetic and automata, Pro~. 196~ I~zt. Congr. Math., Upsala, 1963, pp. 23-25.

[6]

R.L. Constable, Constructive mathematics as a programming logic I: some principles of theory, Ann. Discrete Math. 24, 1985, pp. 21-38.

[7]

E.A. Emerson and J.Y. Halpern, 'Sometimes' and ~not never' revisited' on branching time versus linear time, J. A CM 38, 1986, pp. 151-178.

Digital Library

[8]

E.A. Emerson and C.S. Jutla, The complexity of tree automata and logic of programs, Proc. ~9~h IEEE Syrup. Found. Comp. Sci., 1988.

Digital Library

[9]

C.C. Elgot, Decision problems of finite automata design and related arithmetics, Tra~s. Amer. Math. Soc. 98, 1961, pp. 21- 52.

[10]

E.A. Emerson, Automata, tableaux and temporal logics, Proc. Coal. Logic of Programs, Lec. Notes in Comp. Sci. 193, Springer, 1985, pp. 79-88.

Digital Library

[11]

E.A. Emerson and A.P. Sistl~, Deciding full branching time logic, Inf. and Coat. 61, 1984, pp. 175-201.

[12]

Y. Gurevich and L.A. Harrington, Automata, trees and games, Proc. g~th A CM Syrup. Theory of Computing, 1982, pp. 60- 65.

Digital Library

[13]

D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi, On the temporal analysis of fairness, Proc. 7$h A CM Syrup. Print. Prog. Lang., 1980, pp. 163-173.

Digital Library

[14]

D. Harel, Statecharts: a visual formalism for complex syatems, Sci. Comp. Prog. 8, 1987, pp. 231-274.

Digital Library

[15]

D. Harel and A. Pnueli, On the development of reactive systems, Logics and Models of Concurrent Systems, Springer, 1985, pp. 477-498.

Digital Library

[16]

R. Hossley and C. Rackoff, The emptiness problem for automata on infinite trees, Proc. 13th IEEE Syrup. Switching and Automata Theory, 1972, pp. 121-124.

Digital Library

[17]

T. Hafer and W. Thomas, Computation tree logic CTL* and path quantifiers in the monaclic theory of the binary tree, Proc. 14th Int. Colloq. A ut. LaNg. Prog., Lec. Notes in Comp. Sci. 267, Springer, 1987, pp. 269-279.

Digital Library

[18]

Z. Manna and A. Pnueli, Verification of concurrent programs: the temporal framework, The Correctneas Problem in Computer Scier~ee (R.S. Boyer and J.S. Moore, eds.), Academic Press, London, 1982, pp. 215-273.

[19]

D.E. Muller and P.E. Schupp, Alternating automata on infinite objects, dete:rminancy and rabJm's theorem, Automata oa Iafird~~ Words~, Lec. Notes in Comp. Sci. 192, Springer, :1985, pp. 100-107.

Digital Library

[20]

Z. Manna and R.J. Waldinger, A deductive approach to program synthesis, A CM Trans. Prog. L~ng. Sy3t. 2, 1980, pp. 90- 121.

Digital Library

[21]

Z. Manna and P. Wolper, Synthesis of communicating processes from temporal }logic specifications, A GM Trans. Prog. Lang. Syst. 6, 1984, pp. 68-93.

Digital Library

[22]

A. Pnueli, The temporal logic of programs, Proc. 18th IEEE Syrup. Found. Comp. Sci., 1977, pp. 46-57.

Digital Library

[23]

A. Pnueli, In transition from global to modular temporal reasoning about programs, Logics and Models of Concurrent Systems, Springer, 1985~ pp. 123-144.

[24]

A. Pnueli, Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, Curre,~t Trends in Concurr~r~cy, Lec. Notes in Comp. Sci. 224, Sprlager, 1986, pp. 510--584.

Digital Library

[25]

M.O. Rabin, Decidability of second order theories and automata on infinite trees, Tra~s. A mer. Math. Soc. 141, 1969, pp. 1- 35.

[26]

M.O. Rabin, Automata on Infinite Objects and Churc's Problem, Volume 13 of Regional Conference Series in Mathematics, Amer. Math. Soc., 1972.

Digital Library

[27]

S. Safra, On the complexity of wautomata, Proc. 29th IEEE Syrup. Found. Comp. Sci.~ 1988.

[28]

A.P. Sistla and E.M. Clarke, The complexity of propositional linear time logics, J. A CM 82, 1985, pp. 733-749.

Digital Library

[29]

W. Thomas, Automata on infinite objects, Handbook o/ Theoretical Computer Science, North-Holland. To appear.

[30]

M.Y. Vardi and L.J. Stockmeyer, Improved upper and lower bounds for modal logics of programs, Proc. 17~h A CM Syrup. Theory of Computing, 1985, pp. 240--251.

Digital Library

[31]

M.Y. Vardi and P. Wolper, Automata theoretic techniques for modal logics of programs, J. Comp. Sys. Sci. 32, 1986, pp. 183-221.

Digital Library

[32]

R.:f. Waldlnger and R.C.T. Lee, PROW: a step towrds automatic program writing, Proc. First Int. Joint Conf. on Artificial Inteligenc~, 1969, pp. 241-252.

Cited By

Fang LYang MCheng DHao YGuan QXiong LDastani MSichman JAlechina NDignum V(2024)Generalized Strategy Synthesis of Infinite-state Impartial Combinatorial Games via Exact Binary ClassificationProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662907(562-570)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662907
Catta DLeneutre JMalvone VMurano ADastani MSichman JAlechina NDignum V(2024)Obstruction Alternating-time Temporal Logic: A Strategic Logic to Reason about Dynamic ModelsProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662875(271-280)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662875
Oca JHermo MBolotov A(2024)A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE58400.2024.10546630(1-2)Online publication date: 25-Mar-2024
https://doi.org/10.23919/DATE58400.2024.10546630
Show More Cited By

Index Terms

On the synthesis of a reactive module

Recommendations

Reactive Synthesis from Visibly Register Pushdown Automata
Theoretical Aspects of Computing – ICTAC 2021
Abstract
The realizability problem for a given specification $S$ is to decide whether there exists an implementation satisfying $S$ . Although the problem is important in the field of reactive synthesis of recursive programs, the problem has not been studied ...
Reactive automata

A reactive automaton has extra links whose role is to change the behaviour of the automaton. We show that these links do not increase the expressiveness of finite automata but that they can be used to reduce dramatically their state number both in the ...
Enriched µ-calculus pushdown module checking
LPAR'07: Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning

The model checking problem for open systems (called module checking) has been intensively studied in the literature, both for finite-state and infinite-state systems. In this paper, we focus on pushdown module checking with respect to µ-calculus ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1989

352 pages

ISBN:0897912942

DOI:10.1145/75277

Editor:
CORPORATE New York, NY Association for Computing Machinery

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL89

Sponsor:

POPL89: Symposium on the Principles of Programming Languages

January 11 - 13, 1989

Texas, Austin, USA

Acceptance Rates

POPL '89 Paper Acceptance Rate 30 of 191 submissions, 16%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,000
Total Citations
View Citations
3,130
Total Downloads

Downloads (Last 12 months)325
Downloads (Last 6 weeks)36

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fang LYang MCheng DHao YGuan QXiong LDastani MSichman JAlechina NDignum V(2024)Generalized Strategy Synthesis of Infinite-state Impartial Combinatorial Games via Exact Binary ClassificationProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662907(562-570)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662907
Catta DLeneutre JMalvone VMurano ADastani MSichman JAlechina NDignum V(2024)Obstruction Alternating-time Temporal Logic: A Strategic Logic to Reason about Dynamic ModelsProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662875(271-280)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662875
Oca JHermo MBolotov A(2024)A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE58400.2024.10546630(1-2)Online publication date: 25-Mar-2024
https://doi.org/10.23919/DATE58400.2024.10546630
Yang DShi HDong WDong YZhang Y(2024)Synthesizing Controller for Unsynthesizable Specification Based on Criticality LevelsProceedings of the 15th Asia-Pacific Symposium on Internetware10.1145/3671016.3674815(199-208)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1145/3671016.3674815
Bruyère VFievet BRaskin JTamines C(2024)Stackelberg-Pareto SynthesisACM Transactions on Computational Logic10.1145/365116225:2(1-49)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1145/3651162
Kupferman OShenwald N(2024)The Complexity of LTL Rational SynthesisACM Transactions on Computational Logic10.1145/364847325:2(1-31)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1145/3648473
Brizzio MRoychoudhury APaiva AAbreu RStorey M(2024)Resolving Goal-Conflicts and Scaling Synthesis through Mode-Based DecompositionProceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings10.1145/3639478.3639801(207-211)Online publication date: 14-Apr-2024
https://dl.acm.org/doi/10.1145/3639478.3639801
Patton NRahmani KMissula MBiswas JDillig I(2024)Programming-by-Demonstration for Long-Horizon Robot TasksProceedings of the ACM on Programming Languages10.1145/36328608:POPL(512-545)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632860
Zhong BZamani MCaccamo M(2024)Formal Synthesis of Controllers for Uncertain Linear Systems Against -Regular Properties: A Set-Based ApproachIEEE Transactions on Automatic Control10.1109/TAC.2023.326739769:1(214-229)Online publication date: Jan-2024
https://doi.org/10.1109/TAC.2023.3267397
Iannopollo AIncer ISangiovanni-Vincentelli A(2024)Synthesizing LTL contracts from component libraries using rich counterexamplesScience of Computer Programming10.1016/j.scico.2024.103116236:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.scico.2024.103116
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents