A decidable temporal logic to reason about many processes

Emerson, Allen; Srinivasan, Jai

doi:10.1145/93385.93425

Cited by 9 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The only other temporal logic synthesis method which exploits similarity of processes that we are aware of is that of Emerson and Srinivasan [1990] and Srinivasan [1991]. Specifications in this method are expressed in a logic similar to MPCTL.…”

Section: Related Workmentioning

confidence: 99%

Synthesis of concurrent systems with many similar processes

Attie

Emerson

1998

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Methods for synthesizing concurrent programs from temporal logic specifications based on the use of a decision procedure for testing temporal satisfiability have been proposed by Emerson and Clarke and by Manna and Wolper. An important advantage of these synthesis methods is that they obviate the need to manually compose a program and manually construct a proof of its correctness. One only has to formulate a precise problem specification; the synthesis method then mechanically constructs a correct solution. A serious drawback of these methods in practice, however, is that they suffer from the state explosion problem. To synthesize a concurrent system consisting of K sequential processes, each having N states in its local transition diagram, requires construction of the global product-machine having about N K global states in general. This exponential growth in K makes it infeasible to synthesize systems composed of more than 2 or 3 processes. In this article, we show how to synthesize concurrent systems consisting of many (i.e., a finite but arbitrarily large number K of) similar sequential processes. Our approach avoids construction of the global product-machine for K processes; instead, it constructs a two-process product-machine for a single pair of generic sequential processes. The method is uniform in K, providing a simple template that can be instantiated for each process to yield a solution for any fixed K. The method is also illustrated on synchronization problems from the literature.A preliminary version of some of these results was presented at the ACM Symposium on Principles

show abstract

Section: Related Workmentioning

confidence: 99%

Synthesis of concurrent systems with many similar processes

Attie

Emerson

1998

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…There have been previous approaches to solve parameterized synthesis problems [ES90,AE98]. However, among other restrictions, these results only consider cases PARAMETERIZED SYNTHESIS 3 where information about the environment is essentially the same for all processes.…”

Section: Introductionmentioning

confidence: 99%

Parameterized Synthesis

Jacobs

Bloem

2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We study the synthesis problem for distributed architectures with a parametric number of finite-state components. Parameterized specifications arise naturally in a synthesis setting, but thus far it was unclear how to detect realizability and how to perform synthesis in a parameterized setting. Using a classical result from verification, we show that for a class of specifications in indexed LTL\X, parameterized synthesis in token ring networks is equivalent to distributed synthesis in a network consisting of a few copies of a single process. Adapting a well-known result from distributed synthesis, we show that the latter problem is undecidable. We describe a semi-decision procedure for the parameterized synthesis problem in token rings, based on bounded synthesis. We extend the approach to parameterized synthesis in token-passing networks with arbitrary topologies, and show applicability on a simple case study. Finally, we sketch a general framework for parameterized synthesis based on cutoffs and other parameterized verification techniques.

show abstract

“…In [Emerson and Srinivasan, 1990] an indexed temporal logic is introduced that can be used to specify programs with arbitrarily many similar processes. It is shown that the problems of checking "almost always satisfiability" and "almost always unsatisfiability" are decidable, and a small model property is given.…”

Section: Related Workmentioning

confidence: 99%

Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata

Damm

Horbach

Sofronie-Stokkermans

2015

Frontiers of Combining Systems

View full text Add to dashboard Cite

We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety properties whose verification can be reduced to the verification of (small) families of "neighboring" systems of bounded size, and identify situations in which such verification problems are decidable, resp. fixed parameter tractable. We illustrate the approach with an example from coordinated vehicle guidance, and describe an implementation which allows us to perform such verification tasks automatically.

show abstract

A decidable temporal logic to reason about many processes

Cited by 9 publications

References 17 publications

Synthesis of concurrent systems with many similar processes

Synthesis of concurrent systems with many similar processes

Parameterized Synthesis

Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata

Contact Info

Product

Resources

About