Expressiveness of component-based frameworks: a study of the expressiveness of BIP

DOI10.1007/s00236-019-00337-7zbMath1477.68174OpenAlexW2950053778MaRDI QIDQ2216474

Simon Bliudze, Eduard Baranov

Publication date: 16 December 2020

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00337-7

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• Ptolemy

Cites Work

• A general framework for architecture composability
• A basic algebra of stateless connectors
• SOS formats and meta-theory: 20 years after
• Semantics and expressiveness of ordered SOS
• Branching bisimilarity is an equivalence indeed!
• Universal coalgebra: A theory of systems
• Composition for component-based modeling
• Towards a unified approach to encodability and separation results for process calculi
• Software engineering and formal methods. 12th international conference, SEFM 2014, Grenoble, France, September 1--5, 2014. Proceedings
• Connector Algebras, Petri Nets, and BIP
• A Notion of Glue Expressiveness for Component-Based Systems
• The Algebra of Connectors—Structuring Interaction in BIP
• Formal Methods for Components and Objects
• Causal semantics for the algebra of connectors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item