Describing and analyzing distributed software system designs

Avrunin, George S.; Wileden, Jack C.

doi:10.1145/3916.3989

Cited by 17 publications

(5 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Detailed presentations of these techniques appear elsewhere [2,4,10,121. Their application in a realistic distributed software development setting is illustrated in [3].…”

Section: Resultsmentioning

confidence: 99%

“…The analysis tools automate the algebraic analysis techniques of [2], [4], and [5]. These techniques can be used to determine whether a particular pattern of events appears in any behavior described by a given constrained expression.…”

Section: Resultsmentioning

confidence: 99%

“…send(P, Q, 4 Process P is ready to send a c-signal to process Q. send'(P, 8, cl Process P is ready to resume execution after sending a c-signal to process Q. wait(P, P, Q, c) Process P starves waiting for process Q to request a c-signal from P. wait(Q, P, Q, c) Process Q starves waiting for process P to send a c-signal to Q.…”

Section: Swv)mentioning

confidence: 99%

See 2 more Smart Citations

Constrained expressions: toward broad applicability of analysis methods for distributed software systems

Dillon

Avrunin

Wileden

1988

ACM Trans. Program. Lang. Syst.

Self Cite

View full text Add to dashboard Cite

It is extremely difficult to characterize the possible behaviors of a distributed software system through informal reasoning. Developers of distributed systems require tools that support formal reasoning about properties of the behaviors of their systems. These tools should be applicable to designs and other preimplementation descriptions of a system, as well as to completed programs. Furthermore, they should not limit a developer's choice of development languages.In this paper we present a basis for broadly applicable analysis methods for distributed software systems. The constrained expression formalism can be used with a wide variety of distributed system development notations to give a uniform closed-form representation of a system's behavior. A collection of formal analysis techniques can then be applied with this representation to establish properties of the system. Examples of these formal analysis techniques appear elsewhere. Here we illustrate the broad applicability of the constrained expression formalism by showing how constrained expression representations are obtained from descriptions of systems in three different notations: SDYMOL, CSP, and Petri nets. Features of these three notations span most of the significant alternatives for describing distributed software systems. Our examples thus offer persuasive evidence for the broad applicability of the constrained expression approach.

show abstract

“…Detailed presentations of these techniques appear elsewhere [2,4,10,121. Their application in a realistic distributed software development setting is illustrated in [3].…”

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Constrained expressions: toward broad applicability of analysis methods for distributed software systems

Dillon

Avrunin

Wileden

1988

ACM Trans. Program. Lang. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…DREAM is considered an early attempt to provide automated support for the design of concurrent systems by providing closed-form descriptions of the sequences of certain events occurring in a set of behaviors of the system. While DREAM could only describe embedded systems in which the set of constituent processes and the communication paths connecting them remained static, the Dynamic Process Modeling Scheme (DPMS) was developed for decribing systems with dynamic structure (Avrunin and Wileden 1985). DPMS is based on constrained expressions.…”

Section: Regular Expressionsmentioning

confidence: 99%

Real-time software methodologies: Are they suitable for developing Manufacturing control software?

Chaar

Teichroew

Volz

1993

Int J Flex Manuf Syst

View full text Add to dashboard Cite

Abstract. Computer-Integrated Manufacturing (CIM) systems may be classified as real-time systems. Hence, the applicability of methodologies that are developed for specifying, designing, implementing, testing, and evolving real-time software is investigated in this article.The paper highlights the activities of the software development process. Among these activities, a great emphasis is placed on automating the software requirements specification activity, and a set of formal models and languages for specifying these requirements is presented. Moreover, a synopsis of the real-time software methodologies that have been implemented by the academic and industrial communities is presented together with a critique of the strengths and weaknesses of these methodologies.The possible use of the real-time methodologies in developing the control software of efficient and dependable manufacturing systems is explored. In these systems, efficiency is achieved by increasing the level of concurrency of the operations of a plan, and by scheduling the execution of these operations with the intent of maximizing the utilization of the devices of their systems. On the other hand, dependability requires monitoring the operations of these systems. This monitoring activity facilitates the detection of faults that may occur when executing the scheduled operations of a plan, recovering from these faults, and, whenever feasible, resuming the original schedule of the system. The paper concludes that the set of surveyed methodologies may be used to develop the real-time control software of efficient and dependable manufacturing systems. However, an integrated approach to planning, scheduling, and monitoring the operations of these systems will significantly enhance their utility, and no such approach is supported by any of these methodologies.

show abstract

“…An earlier version of this paper has been published in the Proceedings of the 10th International Conference on Distributed Computing Systems. especially for static analysis of Ada tasking [4][5][6][7][8][9][10][11][12][13][14][15][16]. We previously defined a Petri net framework for this type of analysis [6] and developed a toolkit that supports this approach [10].…”

Section: Introductionmentioning

confidence: 99%

An application of Petri net reduction for Ada tasking deadlock analysis

Shatz

Murata

et al. 1996

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

As part of our continuing research on using Petri nets to support automated analysis of Ada tasking behavior, we have investigated the application of Petri net reduction for deadlock analysis. Although reachability analysis is an important method to detect deadlocks, it is in general inefficient or even intractable. Net reduction can aid the analysis by reducing the size of the net while preserving relevant properties. We introduce a number of reduction rules and show how they can be applied to Ada nets, which are automatically generated Petri net models of Ada tasking. We define a reduction process and a method by which a useful description of a detected deadlock state can be obtained from the reduced net's information. A reduction tool and experimental results from applying the reduction process are discussed.

show abstract

Describing and analyzing distributed software system designs

Cited by 17 publications

References 29 publications

Constrained expressions: toward broad applicability of analysis methods for distributed software systems

Constrained expressions: toward broad applicability of analysis methods for distributed software systems

Real-time software methodologies: Are they suitable for developing Manufacturing control software?

An application of Petri net reduction for Ada tasking deadlock analysis

Contact Info

Product

Resources

About