Compositional reachability analysis using process algebra

Yeh, Wei Jen; Young, Michal

doi:10.1145/120807.120812

Cited by 107 publications

(42 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the reduction techniques by partial ordering, the search space is reduced by excluding the paths formed by the interleaving of the same set of transitions [6]. In techniques by compositional minimization, also known as compositional reachability analysis, the search space is reduced by compositionally constructing the composite LTS where globally observable actions are abstracted out [9,11,12,13].…”

Section: Related Workmentioning

confidence: 99%

“…Various static analysis techniques have been proposed for verifying properties of distributed systems, which include model checking [1], inequality-necessary conditions analysis [2], data flow analysis [3,4], explicit state enumeration [5,6,7,8], and compositional reachability analysis [9,10]. Among these analysis techniques, our approach focuses on compositional reachability analysis techniques, especially based on property automata [10] due to its scalability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS

Lee

Kim

Chae

2007

Software Technologies for Embedded and Ubiquitous Systems

View full text Add to dashboard Cite

Abstract. Safety issues of cooperating embedded systems are very important since they are closely related to our living. In this research, modeling techniques and safety analysis techniques for cooperating embedded systems are provided. Behaviors of embedded systems and safety properties are described by Labeled Transition Systems (LTS). For convenient and effective analysis, we provide a slicing method of the state space of a system according to a property. Based on the slice models, we provided an equivalence algorithm of LTS models and a compositional analysis technique of safety properties.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS

Lee

Kim

Chae

2007

Software Technologies for Embedded and Ubiquitous Systems

View full text Add to dashboard Cite

show abstract

“…In the former category, reduction is achieved by avoiding the generation of all paths formed by the interleaving of the same set of transitions [4,8,15]. In the latter category, reduction is achieved by intermediate simplification of subsystems [10,[12][13][14]17]. Techniques in this category are known as compositional reachability analysis.…”

Section: Related Workmentioning

confidence: 99%

“…Recent literature has reported promising results by employing a compositional approach to generate the model of a system using reachability analysis [12,13,17]. The model is given as …”

Section: Inclusion Of Context Constraintsmentioning

confidence: 99%

Compositional reachability analysis of finite-state distributed systems with user-specified constraints

Cheung

Kramer

1995

SIGSOFT Softw. Eng. Notes

View full text Add to dashboard Cite

The software architecture of a distributed system can be described as a hierarchical composition of subsystems, with interacting processes as the leaves of the hierarchy. Process behaviour can be specified using finite-state machines. A global state machine describing the overall system behaviour can be constructed using compositional reachability analysis techniques. These techniques compose the global state machine of a system from its component processes in stages, based on the specified hierarchy. This staged composition may however exacerbate the state explosion problem. A promising way to alleviate this problem is to include, in the analysis of each subsystem, the behaviour constraints imposed by its environment. Behaviour constraints can be derived algorithmically but may be too weak to adequately constrain the compositional analysis.In this paper, we describe a technique which enables software developers to also specify behaviour constraints intuitively. These constraints can be combined with those derived algorithmically. As constraints specified by software developers may be incorrect, the technique incorporates an effective mechanism to detect incorrect constraints and give an indication of how to correct them. Incorporation of the mechanism does not increase the complexity of analysis. The mechanism is supported by augmenting the state machine model with a special state π. The state is used to capture automatically potential errors in the constraints specified by software developers. The mechanism can also be utilised to detect violation of design assumptions. A gas station system is used as a case study in our discussion.

show abstract

“…In its simplest forms [10,28,32,38,33,34,36,31], compositional verification (also called incremental reduction [32], incremental reachability analysis [33,34], compositional state space generation [36], or inductive compression [31]) consists in replacing each sequential process by an abstraction, simpler than the original process but still preserving the properties to be verified on the whole system. Quite often, abstracting a process is done by minimizing its corresponding Lts modulo an appropriate equivalence or preorder relation (e.g., a bisimulation relation, such as strong, branching, or observational equivalence).…”

Section: Introductionmentioning

confidence: 99%

Refined Interfaces for Compositional Verification

Lang

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronization with the other processes, thus preventing the exploration of states and transitions that would not be reachable in the global state space. Krimm & Mounier, and Cheung & Kramer proposed two techniques to generate such interfaces automatically. In this paper, we propose a refined interface generation technique, in which the interface of a process is derived automatically from the examination of (a subset of) concurrent processes. This technique is applicable to formalisms in which concurrent processes are composed either using synchronization vectors or process algebra parallel composition operators (including those of Ccs, Csp, μCrl, Lotos, and E-Lotos), for which we developed a tool. Several experiments indicate state space reductions by more than two orders of magnitude for the largest processes.

show abstract

Compositional reachability analysis using process algebra

Cited by 107 publications

References 22 publications

Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS

Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS

Compositional reachability analysis of finite-state distributed systems with user-specified constraints

Refined Interfaces for Compositional Verification

Contact Info

Product

Resources

About