A general framework for architecture composability

DOI10.1007/s00165-015-0349-8zbMath1342.68029DBLPjournals/fac/AttieBBJS16OpenAlexW2175855740WikidataQ59436819 ScholiaQ59436819MaRDI QIDQ736458

Eduard Baranov, Paul C. Attie, Simon Bliudze, Joseph Sifakis, Mohamad Y. Jaber

Publication date: 4 August 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-015-0349-8

zbMATH Keywords

livenesssafetyBIParchitecture composabilitycomponent-based frameworks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical problems of computer architecture (68M07)

Related Items (6)

SMT-based generation of symbolic automata ⋮ Weighted propositional configuration logic over De Morgan algebras ⋮ Expressiveness of component-based frameworks: a study of the expressiveness of BIP ⋮ Automatic construction of systems of distributed components from nested Petri nets models ⋮ A general framework for architecture composability ⋮ Weighted propositional configuration logics: a specification language for architectures with quantitative features

Uses Software

• Reo
• Ptolemy
• Metropolis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general framework for architecture composability
• A basic algebra of stateless connectors
• Feature interaction: a critical review and considered forecast.
• Categories for Software Engineering
• Conflict-Tolerant Features
• The Algebra of Connectors—Structuring Interaction in BIP
• Reo: a channel-based coordination model for component composition
• Depth-First Search and Linear Graph Algorithms
• Feature integration using a feature construct
• Causal semantics for the algebra of connectors

This page was built for publication: A general framework for architecture composability