Developing a design framework for communication systems

ion: Specification (V) resulted at the end of step 2. It specifies the same behaviour as (III). As (111) is the specification that resulted at the end of step 1, this suggests that no progress is made in the design. To distinguish between the two expressions an operator is needed that allows you to mark the boundary in an expression between the design decisions made and the design decisions to he made. Such an operator is now added to the notation. This new operator abstracts from certain aspects in a specification. Therefore, it is called an abstraction operator. The operator is denoted by: '•'. It has an expression on the left-hand side and a set of action symbols on the right-hand side. E•B denotes the behaviour of expression E with respect to the action symbols in B. The other action symbols are just a means to obtain this behaviour. They are not part of that what has to he designed. Only their effect on the ordering of action symbols in B is important. Furthermore, this expression abstracts from structural constraints on systems that provide the behaviour. It does not specify a number of subsystems that interact with each other to provide this behaviour. At this stage of the design, the specified system is a black box (hence the symbol used to denote the abstraction operator) with behaviour. Assume that E•B is detailed into El•Bl 11 E2•B2. This expression specifies that the system has to consist of two subsystems in parallel. The behaviour of one subsystem is specified by El•Bl and the behaviour of the other is specified by E2•B2. These subsystems have to he detailed in future detailing steps. In ACP, CSP, and LOTOS this type of abstraction operator does not occur. As these languages only focus on behaviour, their abstraction operator only abstracts from action symbols. CCS has a parallel operator that abstracts from the identity of interactions. As far as we know, the abstraction operator used in this thesis is first presented in [Hui91]. Applying this operator to (IV) yields the following integrated specification: ((w; x; y; z; T)•{w,x, y, x})l{w,x, y,x} with T w; x; y; z;T ~· (((w;x;y; z; T)•{w,x,y,x})f{w,x,y,x}) = 0 Applying this operator to (V) yields the following specification: (E 11 (S•{w,x,y,z})H{w,x,y,z} with E = w; E + x; E + y; E + z; E f!. E = {w,x,y, z} S = w;x;y;z;S ~.S= {w,x,y,x,z} (VI)

[1]  Luis Llana,et al.  A timed LOTOS extension , 1994 .

[2]  Bill Roscoe,et al.  An Operational Semantics for CSP , 1986 .

[3]  Norbert Götz,et al.  Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras , 1993, Performance/SIGMETRICS Tutorials.

[4]  Gerardo Costa,et al.  Weak and Strong Fairness in CCS , 1987, Inf. Comput..

[5]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[6]  Diego Latella,et al.  Performance analysis and true concurrency semantics , 1994 .

[7]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[8]  Derek J. Hatley,et al.  Strategies for Real-Time System Specification , 1987 .

[9]  Data processing-open systems interconnection - basic reference model , 1981, CCRV.

[10]  Liang Chen,et al.  An Interleaving Model for Real-Time Systems , 1992, LFCS.

[11]  Guy Leduc,et al.  An Enhanced Version of Timed LOTOS and its Application to a Case Study , 1993, FORTE.

[12]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.

[13]  Faron Moller,et al.  Behavioural Abstraction in TCCS , 1992, ICALP.

[14]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[15]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[16]  Joachim Parrow,et al.  Submodule Construction as Equation Solving in CCS , 1989, Theor. Comput. Sci..

[17]  M. W. Shields Implicit System Specification and the Interface Equation , 1989, Comput. J..

[18]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[19]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[20]  Jim Davies,et al.  A Brief History of Timed CSP , 1995, Theor. Comput. Sci..

[21]  Job Zwiers,et al.  Compositionality, Concurrency and Partial Correctness , 1989, Lecture Notes in Computer Science.

[22]  James E. Rumbaugh,et al.  Object-Oriented Modelling and Design , 1991 .

[23]  Tommaso Bolognesi,et al.  A timed Full LOTOS with time/action tree semantics , 1994 .

[24]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

[25]  Edsger W. Dijkstra,et al.  A method of programming , 1988 .

[26]  Tommaso Bolognesi,et al.  LOTOS-like Process Algebras with Urgent or Timed Interactions , 1991, FORTE.

[27]  R. J. Huis in 't Veld A formalism to describe concurrent non-deterministic systems and an application of it by analysing systems for danger of deadlock , 1988 .

[28]  Hans A. Hansson Time and probability in formal design of distributed systems , 1991, DoCS.

[29]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[30]  R. J. Huis in 't Veld,et al.  Formalizing the design-trajectory of sequential machines , 1991, Microprocessing and Microprogramming.

[31]  Christopher J. Van Wyk,et al.  Data Structures and C Programs, 2nd Ed. (Addison-Wesley Series in Computer Science) , 1991 .

[32]  Guy Leduc An Upward Compatible Timed Extension to LOTOS , 1991, FORTE.

[33]  M. A Jackson,et al.  System development (Prentice-Hall International series in computer science) , 1983 .

[34]  Matthew Hennessy,et al.  A Temporal Process Algebra , 1990, FORTE.

[35]  Cees J. Koomen Thinking about software design: A meta activity , 1984, ISPW.

[36]  M. De Prycker,et al.  B-ISDN and the OSI protocol reference model , 1993, IEEE Network.

[37]  Robin Milner,et al.  Lectures on a Calculus for Communicating Systems , 1984, Seminar on Concurrency.

[38]  C. J. Koomen The Design of Communicating Systems: A System Engineering Approach , 1991 .

[39]  Teruo Higashino,et al.  LOTOS enhancement to specify time constraint among non-adjacent actions using first order logic , 1993, FORTE.

[40]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..

[41]  Barry W. Boehm,et al.  Software Engineering Economics , 1993, IEEE Transactions on Software Engineering.

[42]  Jos C. M. Baeten,et al.  The Total Order Assumption , 1992, NAPAW.

[43]  Jan Friso Groote,et al.  Specification and verification of real time systems in ACP , 1990, PSTV.

[44]  Paul Ward,et al.  Structured Development for Real-Time Systems , 1986 .

[45]  Gruia-Catalin Roman,et al.  A taxonomy of current issues in requirements engineering , 1985, Computer.

[46]  Roger Lipsett,et al.  VHDL: hardware description and design , 1989 .

[47]  Mohamed G. Gouda,et al.  A discipline for constructing multiphase communication protocols , 1985, TOCS.

[48]  Barry W. Boehm,et al.  A spiral model of software development and enhancement , 1986, Computer.

[49]  D. L. Parnas,et al.  On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.

[50]  Robin Milner,et al.  A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

[51]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[52]  Gordon S. Blair,et al.  Time Versus Abstraction in Formal Description , 1993, FORTE.

[53]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[54]  Marten van Sinderen,et al.  Specification Styles in Distributed Systems Design and Verification , 1991, Theor. Comput. Sci..

[55]  C. J. Koomen Algebraic specification and verification of communication protocols , 1985 .

[56]  Jim Davies,et al.  Real-time CSP , 1994 .

[57]  R. J. van Glabbeek,et al.  Comparative Concurrency Semantics and Refinement of Actions , 1996 .

[58]  Janusz Zalewski Theories and experience for real-time system development , 1996 .

[59]  K. Larsen Context-dependent bisimulation between processes , 1986 .

[60]  Ralf Steinmetz,et al.  Synchronization Properties in Multimedia Systems , 1990, IEEE J. Sel. Areas Commun..

[61]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[62]  Zohar Manna,et al.  The anchored version of the temporal framework , 1988, REX Workshop.

[63]  Gill Smith,et al.  Object-oriented analysis , 1988, WADAS '88.

[64]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[65]  R. V. Glabbeek The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[66]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.