Expressiveness of component-based frameworks: a study of the expressiveness of BIP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177780 (Why is no real title available?)
- scientific article; zbMATH DE number 7440178 (Why is no real title available?)
- A Notion of Glue Expressiveness for Component-Based Systems
- A basic algebra of stateless connectors
- A general framework for architecture composability
- A non-interleaving process calculus for multi-party synchronisation
- Branching bisimilarity is an equivalence indeed!
- Causal semantics for the algebra of connectors
- Combined 19th international workshop on expressiveness in concurrency and 9th workshop on structured operational semantics, Newcastle upon Tyne, UK, September 3, 2012. Proceedings
- Composition for component-based modeling
- Connector algebras, Petri nets, and BIP
- Formal Methods for Components and Objects
- Relating BIP and Reo
- SOS formats and meta-theory: 20 years after
- Semantics and expressiveness of ordered SOS
- Software engineering and formal methods. 12th international conference, SEFM 2014, Grenoble, France, September 1--5, 2014. Proceedings
- The Algebra of Connectors—Structuring Interaction in BIP
- Towards a unified approach to encodability and separation results for process calculi
- Universal coalgebra: A theory of systems
Cited in
(3)
This page was built for publication: Expressiveness of component-based frameworks: a study of the expressiveness of BIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216474)