Model Checking

Bérard, Béatrice; Bidoit, Michel; Finkel, Alain; Laroussinie, François; Petit, Antoine; Petrucci, Laure; Schnoebelen, Philippe; McKenzie, Pierre

doi:10.1007/978-3-662-04558-9_3

Cited by 56 publications

(69 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, the system potentially formed by any model of C 1 and C 2 would not be closed as the occurence of ?e would still be under the control of the environment. Now by preventing the environment from producing !e when C 1 and C 2 are in their initial state, the reachability of the exception state pairs (4, 1) can be avoided 4 . In this section, let us now be optimistic and declare composable any C 1 and C 2 if there exists at least one environment, closing the system and preventing the reachability of bad states of C 1 and C 2 in which the reachability property cannot be guaranteed.…”

Section: Optimistic Composition Of Marked Modal Specificationsmentioning

confidence: 99%

See 1 more Smart Citation

Ensuring Reachability by Design

Caillaud

Raclet

2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

Modular design aims at decomposing systems as a set of distinct components that can be independently developed and then assembled all together. Interfaces are then attached to components; they abstract implementation details while exposing to the environment relevant information about cross-component interactions. Whereas state-of-the-art on interfaces essentially consider independent implementability of safety properties, we consider in this paper reachability properties, which are in general not compositional. The approach we advocate consists in controlling the design flow of components, that is, the evolution of their interfaces through combinations and refinements, in order to ensure a reachability property by construction. Modal specifications are widely acknowledged as a suitable specification formalism for interfacebased design. In order to obtain the required expressivity, we extend them with marked states to model states to be reached. We then develop an algebra with both logical and structural composition operators ensuring reachability properties by design.

show abstract

Section: Optimistic Composition Of Marked Modal Specificationsmentioning

confidence: 99%

“…However, termination is in general not preserved by service composition. Although reachability properties are easy to verify in this context [4], model-checking may not be an appropriate solution. First, because it requires to construct the reachability graph of a system which may lead to a state explosion problem.…”

Section: Introductionmentioning

confidence: 99%

Ensuring Reachability by Design

Caillaud

Raclet

2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

show abstract

“…Requirements engineers can use the names of features from the feature tree and manipulate them as blocks to derive sequences from the text and present them as use cases (Cockburn, 2000), UML sequence diagrams (Cockburn, 1997) or sequential processes in the process algebra notation (Baeten and Weijland, 1990) or as property-formulas in the linear logic (Felty and Namijoshi, 2003;Berard et al, 2001). Now, let us imagine that one of our customers needs to produce anonymous cards, and another onepersonalized cards.…”

Section: Formalizing Requirements For the Systems Producing Anonymousmentioning

confidence: 99%

A Feature Computation Tree Model to Specify Requirements and Reuse

Roubtsova¹,

Roubtsov

2006

Proceedings of the Eighth International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

Abstract:A large subset of requirements for complex systems, services and product lines is traditionally specified by hierarchical structures of features. Features are usually gathered and represented in the form of a feature tree. The feature tree is a structural model. It represents mainly composition and specialization relations between features and does not provide the possibility to specify requirements in the form of ordering relations defined on functional features. Use case scenarios are usually employed for specification of the ordering relations. However, use case scenarios comprise isolated sequences of features, and therefore they may be inconsistent and even may contradict each other and the feature tree. Moreover, some use case scenarios defining relations on features may be incomplete. In order to support consistent specification of requirements, we suggest using a pair of related models: a feature tree model and a feature computation tree model. The pair of such related feature tree models provides the basis for the method of consistency checks of requirements. It introduces a united view on the system's behavior at the stage of requirement specification and facilitates specification of forbidden sequences and construction complete sequences from incomplete ones. It allows designers to precisely specify the desired reuse and to find that a certain sort of reuse is not possible. Understanding already at the stage of requirements engineering that a subsystem cannot be reused without modification saves effort and money spent on development. The proposed method and models are explained using a case study of design of a system for electronic cards production.

show abstract

“…Model checking, i.e., the automated verification that (the formal model of) a system satisfies some formal behavioral property, has proved to be a revolutionary advance for the correctness of critical systems, see, e.g., [13,2].…”

Section: Introductionmentioning

confidence: 99%

“…Additional parameters, such as alphabet size and number of states, are used in [55]. Problems complete for the classes W [1], W [2] and W[P] are investigated in [55,8]. Compared to our study, these works mainly consider deterministic automata and are concerned with automata-theoretic (or language-theoretic) questions rather than verification and model-checking questions.…”

Section: Introductionmentioning

confidence: 99%

A Parametric Analysis of the State Explosion Problem in Model Checking

2002

View full text Add to dashboard Cite

In model checking, the state-explosion problem occurs when one checks a non-flat system, i.e., a system implicitly described as a synchronized product of elementary subsystems. In this paper, we investigate the complexity of a wide variety of modelchecking problems for non-flat systems under the light of parameterized complexity, taking the number of synchronized components as a parameter. We provide precise complexity measures (in the parameterized sense) for most of the problems we investigate, and evidence that the results are robust.

show abstract

Model Checking

Cited by 56 publications

References 0 publications

Ensuring Reachability by Design

Ensuring Reachability by Design

A Feature Computation Tree Model to Specify Requirements and Reuse

A Parametric Analysis of the State Explosion Problem in Model Checking

Contact Info

Product

Resources

About