Distributed synthesis for LTL fragments

Chatterjee, Krishnendu; Henzinger, Thomas A.; Otop, Jan; Pavlogiannis, Andreas

doi:10.1109/fmcad.2013.6679386

Cited by 18 publications

(15 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is a rich literature regarding the synthesis of distributed systems from global ω-regular specifications [10,11,12,13,17,18,19,20]. We are not aware of work that is concerned with the realizability of parameterized logics in this setting.…”

Section: Related Workmentioning

confidence: 99%

Distributed synthesis for parameterized temporal logics

Jacobs

Tentrup

Zimmermann

2018

Information and Computation

View full text Add to dashboard Cite

We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis, it is well-established that such parametric extensions do not increase worst-case complexities. For synchronous distributed systems, we show that, despite being more powerful, the realizability problem for PROMPT-LTL is not harder than its LTL counterpart. For asynchronous systems, we have to express scheduling assumptions and therefore consider an assume-guarantee synthesis problem. As asynchronous distributed synthesis is already undecidable for LTL, we give a semi-decision procedure for the PROMPT-LTL assume-guarantee synthesis problem based on bounded synthesis. Finally, we show that our results extend to the stronger logics PLTL and PLDL.

show abstract

Section: Related Workmentioning

confidence: 99%

Distributed synthesis for parameterized temporal logics

Jacobs

Tentrup

Zimmermann

2018

Information and Computation

View full text Add to dashboard Cite

show abstract

“…Although QBFs are capable of encoding decision problems in the PSPACE complexity class, they are not powerful enough to succinctly encode many natural and practical problems that involve decisions under partial information. For example, the analysis of games with incomplete information (Peterson, Reif, and Azhar 2001), topologically constrained synthesis of logic circuits (Balabanov, Chiang, and Jiang 2014), synthesis of safe controllers (Bloem, Könighofer, and Seidl 2014), synthesis of fragments of linear-time temporal logic (Chatterjee et al 2013), and verification of partial designs (Scholl and Becker 2001;Gitina et al 2013) fall into this category and require an even more general formalism known as dependency quantified Boolean formulas (DQBFs) (Peterson, Reif, and Azhar 2001).…”

Section: Introductionmentioning

confidence: 99%

A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving

Scholl

Jiang

Wimmer

et al. 2019

AAAI

View full text Add to dashboard Cite

Dependency quantified Boolean formulas (DQBFs) are a powerful formalism, which subsumes quantified Boolean formulas (QBFs) and allows an explicit specification of dependencies of existential variables on universal variables. This enables a succinct encoding of decision problems in the NEXPTIME complexity class. As solving general DQBFs is NEXPTIME complete, in contrast to the PSPACE completeness of QBF solving, characterizing DQBF subclasses of lower computational complexity allows their effective solving and is of practical importance. Recently a DQBF proof calculus based on a notion of fork extension, in addition to resolution and universal reduction, was proposed by Rabe in 2017. We show that this calculus is in fact incomplete for general DQBFs, but complete for a subclass of DQBFs, where any two existential variables have either identical or disjoint dependency sets over the universal variables. We further characterize this DQBF subclass to be Σ P 3 complete in the polynomial time hierarchy. Essentially using fork extension, a DQBF in this subclass can be converted to an equisatisfiable 3QBF with only a linear increase in formula size. We exploit this conversion for effective solving of this DQBF subclass and point out its potential as a general strategy for DQBF quantifier localization. Experimental results show that the method outperforms state-of-the-art DQBF solvers on a number of benchmarks, including the 2018 DQBF evaluation benchmarks.

show abstract

“…Related Work. There is a rich literature regarding the synthesis of distributed systems from global ω-regular specifications [4,7,13,15,17,18]. We are not aware of work that is concerned with the realizability of parameterized logics in this setting.…”

Section: Introductionmentioning

confidence: 99%

Distributed PROMPT-LTL Synthesis

Jacobs¹,

Tentrup²,

Zimmermann³

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (PROMPT-LTL), which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis it is well-established that such parametric extensions do not increase worst-case complexities.For synchronous systems, we show that, despite being more powerful, the distributed realizability problem for PROMPT-LTL is not harder than its LTL counterpart. For asynchronous systems we have to consider an assume-guarantee synthesis problem, as we have to express scheduling assumptions. As asynchronous distributed synthesis is already undecidable for LTL, we give a semi-decision procedure for the PROMPT-LTL assume-guarantee synthesis problem based on bounded synthesis.

show abstract

Distributed synthesis for LTL fragments

Cited by 18 publications

References 14 publications

Distributed synthesis for parameterized temporal logics

Distributed synthesis for parameterized temporal logics

A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving

Distributed PROMPT-LTL Synthesis

Contact Info

Product

Resources

About