Download PDF by Alessandro Aldini: A Process Algebraic Approach to Software Architecture Design

By Alessandro Aldini

ISBN-10: 184800222X

ISBN-13: 9781848002227

ISBN-10: 1848002238

ISBN-13: 9781848002234

Concurrency concept, software program structure, approach modeling and verification, and dependability and function review could seem unrelated disciplines, yet in truth they're deeply intertwined and will join an built-in view with a view to effectively deal with the expanding complexity of software program platforms today.

This booklet introduces a technique algebraic method of software program structure layout. strategy algebra, initially conceived for reasoning concerning the semantics of concurrent courses, offers a foundational foundation for the modeling and verification of sensible and nonfunctional facets of speaking concurrent platforms. this is exploited on the software program structure point of layout to enhance the formality of layout files and make attainable the research of procedure houses on the early layout stages.

The first a part of the booklet deals an outline of the suggestions and result of method algebra concept delivering heritage fabric at the syntax and semantics for method calculi in addition to at the bisimulation, trying out, and hint ways to the definition of behavioral equivalences for nondeterministic, deterministically timed, and stochastically timed processes.

Part offers directions for a principled transformation of strategy algebra into an architectural description language, prior to demonstrating the best way to use method algebraic innovations to deal with the detection of architecture-level mismatches, performance-driven choice between substitute designs, and the fulfillment of a tradeoff among dependability positive aspects and function indices.

Graduate scholars and software program pros, will discover a procedure Algebraic method of software program structure layout an invaluable addition to their bookshelf.

Show description

Read Online or Download A Process Algebraic Approach to Software Architecture Design PDF

Similar systems analysis & design books

Read e-book online Reliability of Computer Systems and Networks PDF

With pcs turning into embedded as controllers in every thing from community servers to the routing of subway schedules to NASA missions, there's a severe have to make sure that platforms proceed to operate even if an element fails. during this e-book, bestselling writer Martin Shooman attracts on his services in reliability engineering and software program engineering to supply a whole and authoritative examine fault tolerant computing.

Download e-book for kindle: Fuzzy neural intelligent systems: mathematical foundation by Hongxing Li, C.L. Philip Chen, Han-Pang Huang

Even if fuzzy structures and neural networks stand imperative to the sector of soppy computing, so much learn paintings has targeted within the improvement of the theories, algorithms, and designs of structures for particular functions. there was little theoretical help for fuzzy neural structures, in particular their mathematical foundations.

New PDF release: Fifty Quick Ideas To Improve Your Tests

This publication is for cross-functional groups operating in an iterative supply atmosphere, making plans with person tales and checking out often altering software program lower than difficult time strain. This publication can assist you attempt your software program greater, more uncomplicated and quicker. lots of those principles additionally support groups have interaction their enterprise stakeholders larger in defining key expectancies and enhance the standard in their software program items.

Additional resources for A Process Algebraic Approach to Software Architecture Design

Example text

0. This example shows that axiom τ . , it cannot perform τ -actions. In fact, congruence with respect to the alternative composition operator can be restored by enforcing a matching on initial τ -actions in the equivalence definition. 13. Let P1 , P2 ∈ P. 5. ≈cB is the largest congruence contained in ≈B . 3 axiom τ . P = P is no longer valid for ≈cB ; hence, ≈cB can abstract only from some intermediate τ -actions. We also mention that ≈B does not fully retain the property possessed by ∼B of respecting the branching structure of process terms.

Let P1 , P2 ∈ P. τ ∗ an • If α ≡ a1 . . , a set of tests that are necessary and sufficient in order to establish whether two process terms are testing equivalent. Each of these canonical tests admits a main computation leading to a final state, which either denotes failure or reaches success in one step after executing any of its actions. The intermediate states and the final state are able to detect divergence through τ . ω . 0. 20. The set Tc,may of canonical may-tests is generated by the following syntax: T ::= ω .

P1 ∼B a . P2 for all a ∈ Name. P1 + P ∼B P2 + P and P + P1 ∼B P + P2 for all P ∈ P. P1 S P ∼B P2 S P and P S P1 ∼B P S P2 for all P ∈ P and S ⊆ Namev . P1 /H ∼B P2 /H for all H ⊆ Namev . P1 \L ∼B P2 \L for all L ⊆ Namev . P1 [ϕ ] ∼B P2 [ϕ ] for all ϕ ∈ Relab. As far as recursion is concerned, we need to extend ∼B to open process terms by considering all possible syntactical substitutions replacing any free occurrence of a process variable with a closed process term. 8. Let P1 , P2 ∈ PL be guarded process terms containing free occurrences of k ∈ N process variables X1 , .

Download PDF sample

A Process Algebraic Approach to Software Architecture Design by Alessandro Aldini

by Daniel

Rated 4.88 of 5 – based on 5 votes