A Relational Model for Probabilistic Connectors Based on Timed Data Distribution Streams

Sun, Min; Zhang, Xiyue

doi:10.1007/978-3-030-00151-3_8

Cited by 5 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, future research is also investigating the quantitative behavior of component-based systems, whose connectors are defined by our weighted algebra (cf. also [BLM06,BMM11,NS19,SZ18]). On the other hand, several theories and languages have modeled connectors as entities that both exhibit behavior and express interactions which may be modified during the system's operation [BCD00,Pah01].…”

Section: Discussionmentioning

confidence: 95%

“…Plenty of work has also investigated Reo connectors with probabilistic behavior (cf. [NS19,SZ18]). In [SZ18], the authors studied Reo connectors with probabilistic behavior as timed data distribution streams implemented in Coq.…”

Section: Related Workmentioning

confidence: 99%

“…[NS19,SZ18]). In [SZ18], the authors studied Reo connectors with probabilistic behavior as timed data distribution streams implemented in Coq. Moreover, in [NS19] the authors formalized Reo connectors with random and probabilistic behavior in PVS.…”

Section: Related Workmentioning

confidence: 99%

“…Applications of connectors occur in cloud and grid computing technologies with several functionalities including shared variable accesses, buffers, networking protocols, pipes etc. Rigorous formalization of connectors has been proved crucial for the efficient modeling and analysis of coordinated software systems [BMM11,SZ18]. Connectors have been studied extensively in systems modeling with alternative frameworks and expressiveness, including process algebras [BCD00,BMM11] and category theory [BLM06,BMM11], while they have been also supported by several architectural description languages (ADLs for short) [Ozk18,NS19,SZ18].…”

Section: Introductionmentioning

confidence: 99%

“…Such features include timing constraints, available resources, energy consumption, probabilities, etc., for implementing the interactions among the systems' components. Existing frameworks have focused mainly on the qualitative setup, while some work on the probabilistic behavior of connectors can be found in [NS19,SZ18]. Hence, the novelty of our paper lies in the study of a generic algebraic formal framework for weighted connectors, that has not been addressed in most of the existing work.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A formal algebraic approach for the quantitative modeling of connectors in architectures

Chrysovalanti¹,

Pittou²

2022

Preprint

View full text Add to dashboard Cite

In this paper we propose an algebraic formalization of connectors in the quantitative setting in order to address the performance issues related with the architectures of component-based systems. For this, we firstly introduce a weighted Algebra of Interactions over a set of ports and a commutative and idempotent semiring. The algebra serves sufficiently for modeling wellknown coordination schemes in the weighted setup. In turn, we introduce and study a weighted Algebra of Connectors over a set of ports and a commutative and idempotent semiring, which extends the weighted Algebra of Interactions with types that express two different modes of synchronization, in particular, Rendezvous and Broadcast. We show the expressiveness of the algebra by modeling several weighted connectors. Moreover, we derive two subalgebras, namely the weighted Algebra of Synchrons and of Triggers, and study their properties. Finally, we introduce a weighted congruence relation for connectors and provide conditions for proving congruence between distinct weighted connectors.

show abstract

Section: Discussionmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A formal algebraic approach for the quantitative modeling of connectors in architectures

Chrysovalanti¹,

Pittou²

2022

Preprint

View full text Add to dashboard Cite

show abstract

Modeling and Verification of Component Connectors

Zhang

2018

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Using PVS for Modeling and Verification of Probabilistic Connectors

Nawaz¹,

Sun²

2019

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

Reo is a channel-based coordination language that allows the construction of connectors to coordinate behavior among different components in distributed systems. Probabilistic connectors in Reo capture the random and probabilistic behavior to deal with the uncertainty of the real world. In this paper we use PVS to provide a mechanical formalization for probabilistic connectors. We first present the formalization of random/probabilistic channels and the composition operators in PVS. Random and probabilistic channels are modeled as relations on timed data distribution sequences that are observed at the source and sink ends of these channels. Composition operators are used to combine random/probabilistic channels together with primitive channels to construct complex component connectors. The approach can be used to naturally specify complex connectors and prove important properties for probabilistic connectors as well as the refinement/equivalence relations between them with the PVS proof assistant.

show abstract

A Relational Model for Probabilistic Connectors Based on Timed Data Distribution Streams

Cited by 5 publications

References 13 publications

A formal algebraic approach for the quantitative modeling of connectors in architectures

A formal algebraic approach for the quantitative modeling of connectors in architectures

Modeling and Verification of Component Connectors

Using PVS for Modeling and Verification of Probabilistic Connectors

Contact Info

Product

Resources

About