A Visual Approach to Distributed Programming

Ng, Keng; Kramer, Jeff; Magee, Jeff; Dulay, Naranker

doi:10.1007/978-1-4615-4123-3_2

Cited by 8 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This permits the design of a subsystem hierarchy to be based more on logical than efficiency criteria. Supporting analysis tools [Giannakopoulou et al 1999] have been implemented, and we are proposing to incorporate these into an environment for the design and construction of distributed programs, the System Architect's Assistant [Ng et al 1996] which utilizes the Darwin language [Magee et al 1994] for the specification of the software architectures. Finally we are investigating an approach for the specification and checking of liveness properties [Cheung et al 1997] which would complement the enhanced CRA approach for safety properties described in this article.…”

Section: Discussionmentioning

confidence: 99%

Checking safety properties using compositional reachability analysis

Cheung

Kramer

1999

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compositional reachability analysis (CRA) is a promising state reduction technique which can be automated and used in stages to derive the overall behaviour of a distributed program based on its architecture. CRA is particularly suitable for the analysis of programs that are subject to evolutionary change. When a program evolves, only the behaviours of those subsystems affected by the change need be reevaluated. The technique however has a limitation. The properties available for analysis are constrained by the set of actions that remain globally observable.Properties involving actions encapsulated by subsystems may therefore not be analysed. In this paper, we enhance the CRA technique to check safety properties which may contain actions that are not globally observable. To achieve this, the state machine model is augmented with a special trap state labelled as n. We propose a scheme to transform, in stages, a property that involves hidden actions to one that involves only globally observable actions. The enhanced technique also includes a mechanism aiming at reducing the debugging effort. The technique is illustrated using a gas station system example. This paper is an invited submission to TOSEM, a revised and extended version of [Cheung96a].

show abstract

Section: Discussionmentioning

confidence: 99%

Checking safety properties using compositional reachability analysis

Cheung

Kramer

1999

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Message sequence charts [102], for instance, have already been used to document protocol standards of communication systems; the same is true for object-oriented modeling languages like ROOM [103], which was one of the first (truly) object-oriented modeling tools successfully used by the telecommunication industry. Some examples of distributed system visual programming languages are G-Net [34,35], Prograph [104], DVispatch [105], which rely on different programming paradigms and formalisms (such as Petri-Nets [106] and Flow-Graphs [107]). In [68], an approach for the GT-based rapid prototyping of variants of TC algorithms is proposed.…”

Section: Rq4-generalizabilitymentioning

confidence: 99%

“…Languages like eMoflon [23] or MechatronicUML [33] even integrate GT concepts for dynamic communication topology manipulation purposes with UML-like activity, class, and composite structure diagrams as well as state charts. Apart from these languages, the VL community has already been developing visual programming languages with well-defined syntax and semantics for distributed communication and information system construction purposes for several decades (e.g., G-Net [34,35]). A comprehensive survey of related research activities can be found in [36][37][38].…”

Section: Introductionmentioning

confidence: 99%

A systematic approach to constructing incremental topology control algorithms using graph transformation

Kluge

Stein²,

Varr

et al. 2017

Journal of Visual Languages & Computing

View full text Add to dashboard Cite

This document corresponds to the accepted manuscript of the article Kluge, R., Stein, M., Varró, G., Schürr, A., Hollick, M., Mühlhäuser, M.: "A Systematic Approach to Constructing Incremental Topology Control Algorithms using Graph Transformation," in: JVLC 2016. The URL of the formal version is https://dx.Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently introduced modifications of a topology. Visual programming and specification languages are a proven means for specifying the structure as well as consistency and optimization properties of topologies. In this paper, we present a novel methodology, based on a visual graph transformation and graph constraint language, for developing incremental topology control algorithms that are guaranteed to fulfill a set of specified consistency and optimization constraints. More specifically, we model the possible modifications of a topology control algorithm and the environment using graph transformation rules, and we describe consistency and optimization properties using graph constraints. On this basis, we apply and extend a well-known constructive approach to derive refined graph transformation rules that preserve these graph constraints. We apply our methodology to re-engineer an established topology control algorithm, kTC, and evaluate it in a network simulation study to show the practical applicability of our approach. Meta-modeling [Sec. 2] WSN meta-model Topology control (TC) Graph constraints [Sec. 3] Structural constraints TC constraints Connectivity Consistency Graph transformation [Sec. 4] TC rules TC algorithm Context event rules Rule refinement [Sec. 5] Rule refinement algorithm Restoring rule applicability Enforcing termination Proving preservation of connectivity Evaluation [Sec. 6] RQ1: Correctness RQ2: Incrementality RQ3: Generalizability RQ4: Performance Figure 1: Overview of the proposed constructive methodology and structure of this paper (i) We characterize the required and desired properties of output topologies of a TC algorithm using graph constraints (as described in [42]).(ii) We use GT rules to describe TC operations, which specify the possible modifications during an execution of a TC algorithm, and context events, which specify the possible modifications by the environment.(iii) We apply and enhance the constructive refinement approach for GT rules presented in [42,43] to TC. Our approach is able to cope with temporarily constraint-violating rules, which contrary to [42,43] may not be restricted.(iv) We ...

show abstract

“…• Structural modeling using the Architecture Description Language called Darwin -This step defines the relationship between the components in a structural model [8,9].…”

Section: A Formal Modelingmentioning

confidence: 99%

Real-time service accounting

Beijnum

Goede

IEEE Workshop on IP Operations and Management

View full text Add to dashboard Cite

Offering telematics services toward the end-users involves inter-domain real-time service provisioning, it therefore can also involves inter-domain real-time service accounting. Recognizing the increasing complexity of accounting services due to dynamic service usage behavior of the end-users, the paper addresses a way to first, decompose end-to-end service into accountable service components and second, apply formal modeling and analysis to service component accounting management.

show abstract

A Visual Approach to Distributed Programming

Cited by 8 publications

References 13 publications

Checking safety properties using compositional reachability analysis

Checking safety properties using compositional reachability analysis

A systematic approach to constructing incremental topology control algorithms using graph transformation

Real-time service accounting

Contact Info

Product

Resources

About