Abstract The conjunction, disjunction, and exclusive disjunction operators are proposed as extensions to the data flow diagram analysis tool for specifying the input/output interfaces of the processes. These interfaces are expressions which are formed by using the proposed operators. The input/output interfaces of a process P define the semantics of the process P, i.e., if α denotes the input interface and β the output interface of P, then the execution of P requires an instance of α to produce an instance of β. The notion of process interface modeling provides a formal basis for consistency checking in process decomposition. Let α and β be the input/output interfaces of a process P, and N p be a network of subprocesses which refines P. We say that N p is consistent with P if the execution of N p produces an instance of β when given an instance of α. A method for formally testing the consistency of a network of subprocesses with respect to the original process will be described. The method is illustrated by a software design example.
[1]
Tom DeMarco,et al.
Structured Analysis and System Specification
,
1978
.
[2]
Stephen S. Yau,et al.
Distributed Software System Design Representation Using Modified Petri Nets
,
1983,
IEEE Transactions on Software Engineering.
[3]
Edward Yourdon,et al.
Modern structured analysis
,
1989
.
[4]
David Harel,et al.
On visual formalisms
,
1988,
CACM.
[5]
Michael R. Genesereth,et al.
Logic programming
,
1985,
CACM.
[6]
Mike Adler,et al.
An Algebra for Data Flow Diagram Process Decomposition
,
1988,
IEEE Trans. Software Eng..
[7]
Paul T. Ward,et al.
The transformation schema: An extension of the data flow diagram to represent control and timing
,
1986,
IEEE Transactions on Software Engineering.