2008
DOI: 10.1007/978-3-540-68863-1_8
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and Model Checking Software Product Lines

Abstract: Abstract. Software product line engineering combines the individual developments of systems to the development of a family of systems consisting of common and variable assets. In this paper we introduce the process algebra PL-CCS as a product line extension of CCS and show how to model the overall behavior of an entire family within PL-CCS. PL-CCS models incorporate behavioral variability and allow the derivation of individual systems in a systematic way due to a semantics given in terms of multi-valued modal … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
123
0
1

Year Published

2010
2010
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 114 publications
(124 citation statements)
references
References 20 publications
0
123
0
1
Order By: Relevance
“…Transitions are ordered to deal with the situation when two or more features are selected and some transition should override another. PL-CSS [94] is an extension of CCS with a variant operator to represent a family of processes. The variant operation expresses a choice based on which variant is selected.…”
Section: Solution Space Variabilitymentioning
confidence: 99%
See 1 more Smart Citation
“…Transitions are ordered to deal with the situation when two or more features are selected and some transition should override another. PL-CSS [94] is an extension of CCS with a variant operator to represent a family of processes. The variant operation expresses a choice based on which variant is selected.…”
Section: Solution Space Variabilitymentioning
confidence: 99%
“…Safety properties that hold for the entire model are guaranteed to hold for all generated properties, and violations of a property result in a counterexample trace along with the products that violate the property. A version of the modal-µ calculus is used to reason about PL-CSS expressions [94]. The semantics of the formula presented is particularly interesting: rather than simply stating whether a formula is true or false, the semantics gives the set of variants for which the formula is true.…”
Section: Model Checkingmentioning
confidence: 99%
“…Several approaches has been proposed for formal modeling of SPLs using SMV [14], automata and transition based systems [15,10,16,17], process algebra [18], Petri nets [19], and Promela [20]. These approaches capture the behavior of the entire product family in a single model by including the variability information in it using annotations.…”
Section: Related Workmentioning
confidence: 99%
“…Annotating a transition/statement with an application condition indicates the configurations that enable the transition/statement. In [18], an operator is added to CCS to specify alternative processes. To model check annotated models, model checking technique has been adapted in [10] to verify featured transition systems.…”
Section: Related Workmentioning
confidence: 99%
“…We have extended MTSs in [17] to allow modelling different notions of behavioural variability. A different, algebraic approach to behavioural modelling and verification of product lines instead has been developed in [20,21]. In this paper, we continue research we started in [3,4].…”
Section: Related Workmentioning
confidence: 99%