[1504.03474] Coherent branching feature bisimulation
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1504.03474 (cs)
[Submitted on 14 Apr 2015]

Title:Coherent branching feature bisimulation

Authors:Tessa Belder (TU/e, Eindhoven, The Netherlands), Maurice H. ter Beek (ISTI-CNR, Pisa, Italy), Erik P. de Vink (TU/e, Eindhoven and CWI, Amsterdam, The Netherlands)
View PDF
Abstract:Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS) generalizing branching bisimulation for labeled transition systems (LTS). We prove that branching feature bisimulation for an FTS of a family of products coincides with branching bisimulation for the LTS projection of each the individual products. For a restricted notion of coherent branching feature bisimulation we furthermore present a minimization algorithm and show its correctness. Although the minimization problem for coherent branching feature bisimulation is shown to be intractable, application of the algorithm in the setting of a small case study results in a significant speed-up of model checking of behavioral properties.
Comments: In Proceedings FMSPLE 2015, arXiv:1504.03014
Subjects: Logic in Computer Science (cs.LO); Software Engineering (cs.SE)
ACM classes: D.2.4; F.3.1; F.3.2
Cite as: arXiv:1504.03474 [cs.LO]
  (or arXiv:1504.03474v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1504.03474
Journal reference: EPTCS 182, 2015, pp. 14-30
Related DOI: https://doi.org/10.4204/EPTCS.182.2

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 14 Apr 2015 09:56:21 UTC (35 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2015-04
Change to browse by:
cs
cs.SE

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)