Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

Bonakdarpour, Borzoo; Kulkarni, Sandeep S.

doi:10.1109/icdcs.2007.109

Cited by 37 publications

(67 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, in [Bonakdarpour and Kulkarni 2007], we have shown that symbolic techniques can be used to effectively synthesize distributed programs with the size of reachable states exceeding 2 100 . We, therefore, expect that these approaches would also assist significantly in managing state space during the addition of UNITY properties.…”

Section: Discussionmentioning

confidence: 99%

Revising UNITY Programs: Possibilities and Limitations

Ebnenasir

Kulkarni

Bonakdarpour

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We concentrate on automatic addition of untimed and real-time UNITY properties to programs by local redesign. The main focus of this paper is to identify instances where addition of UNITY properties can be achieved efficiently (in polynomial time) and where the problem of adding UNITY properties is difficult (NP-complete).Regarding addition of UNITY properties in polynomial time, we present a sound and complete algorithm that adds a single leads-to property (respectively, bounded-time leads-to property) and a conjunction of unless, stable, and invariant properties (respectively, bounded-time unless and stable) to an existing untimed (respectively, real-time) UNITY program. Since ensures can be expressed as a conjunction of a leads-to and unless, our algorithms can also be used to add one ensures property along with a conjunction of safety properties.Regarding hardness results, we show that (1) while one leads-to (respectively, ensures) property can be added in polynomial time, the problem of adding two such properties (or any combination of leads-to and ensures) is NP-complete, (2) if maximum non-determinism is desired then the problem of adding even a single leads-to property is NP-complete, and (3) the problem of providing maximum non-determinism while adding a single bounded-time leads-to property to a real-time program is NP-complete (in the size of the time-abstract bisimulation representation of the program) even if the original program satisfies the corresponding unbounded leads-to property.

show abstract

Section: Discussionmentioning

confidence: 99%

Revising UNITY Programs: Possibilities and Limitations

Ebnenasir

Kulkarni

Bonakdarpour

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, some transitions cannot be removed (like the uncontrollable transitions in DCS), but this is the case only of fault transitions (while in DCS, any event can be uncontrollable, not only faults). An efficient BDD-based algorithm has been presented in [8] and implemented in the SYCRAFT tool [10]. 8 Attie et al have also proposed an automatic synthesis method for fault tolerant programs [3].…”

Section: Related Workmentioning

confidence: 99%

“…An efficient BDD-based algorithm has been presented in [8] and implemented in the SYCRAFT tool [10]. 8 Attie et al have also proposed an automatic synthesis method for fault tolerant programs [3]. In their approach, a system is a set of concurrent processes, each consisting of a directed graph, where states are connected by transitions labeled by guarded commands.…”

Section: Related Workmentioning

confidence: 99%

Automating the addition of fault tolerance with discrete controller synthesis

Girault

Rutten

2009

Form Methods Syst Des

View full text Add to dashboard Cite

Abstract. Discrete controller synthesis (DCS) is a formal approach, based on the same state-space exploration algorithms as model-checking. Its interest lies in the ability to obtain automatically systems satisfying by construction formal properties specified a priori. In this paper, our aim is to demonstrate the feasibility of this approach for fault tolerance. We start with a fault intolerant program, modeled as the synchronous parallel composition of finite labeled transition systems; we specify formally a fault hypothesis; we state some fault tolerance requirements; and we use DCS to obtain automatically a program, having the same behavior as the initial fault intolerant one in the absence of faults, and satisfying the fault tolerance requirements under the fault hypothesis. Our original contribution resides in the demonstration that DCS can be elegantly used to design fault tolerant systems, with guarantees on key properties of the obtained system, such as the fault tolerance level, the satisfaction of quantitative constraints, and so on. We show with numerous examples taken from case studies that our method can address different kinds of failures (crash, value, or Byzantine) affecting different kinds of hardware components (processors, communication links, actuators, or sensors). Besides, we show that our method also offers an optimality criterion very useful to synthesize fault tolerant systems compliant to the constraints of embedded systems, like power consumption.

show abstract

“…Our work is orthogonal to that in [3] in that this work can be extended in the context of dealing with probabilities and their work can be extended to deal with addition of graceful degradation. Algorithms for automatic addition of faulttolerance [1], [6] add fault-tolerance concerns to existing untimed or real-time programs in the presence of faults, and guarantee the addition of no new behaviors to the original program in the absence of faults. In the context of this paper, we utilize the synthesis algorithm for adding fault-tolerance.…”

Section: Related Workmentioning

confidence: 99%

“…Some of the existing approaches for automated addition of fault-tolerance include [1]- [3], where three different levels of fault-tolerance, namely nonmasking, masking and stabilizing, are considered. In all these levels, if the fault perturbs the program then it is guaranteed to recover to legitimate states from where it satisfies its specification.…”

Section: Introductionmentioning

confidence: 99%

Automatic Generation of Graceful Programs

Lin

Kulkarni

2012

2012 IEEE 31st Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

Abstract-Traditionally, (nonmasking and masking) faulttolerance has focused on ensuring that after the occurrence of faults, the program recovers to states from where it continues to satisfy its original specification. However, a problem with this limited notion is that, in some cases, it may be impossible to recover to states from where the entire original specification is satisfied. For this reason, one can consider a fault-tolerant graceful-degradation program that ensures that upon the occurrence of faults, the program recovers to states from where a (given) subset of its specification is satisfied. Typically, the subset of specification satisfied thus would be the critical requirements.In this paper, we focus on automatically revising a given program to obtain a corresponding graceful program, i.e., a program that satisfies a weaker specification. Specifically, this step involves adding new behaviors that satisfy the given subset of specification. Moreover, it ensures that during this process, it does not remove any behavior from the original program. With this motivation, in this paper, we focus on automatic derivation of the graceful program, i.e., a program that contains all behaviors of the original program and some new behaviors that satisfy the weaker conditions. We note that this aspect differentiates this work from previous work on controller synthesis as well as automated addition of faulttolerance in that this work requires that no new behaviors are added in the absence of faults.

show abstract

Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

Cited by 37 publications

References 15 publications

Revising UNITY Programs: Possibilities and Limitations

Revising UNITY Programs: Possibilities and Limitations

Automating the addition of fault tolerance with discrete controller synthesis

Automatic Generation of Graceful Programs

Contact Info

Product

Resources

About