1989
DOI: 10.1093/comjnl/32.1.1
|View full text |Cite
|
Sign up to set email alerts
|

Towards a Formal Foundation for DeMarco Data Flow Diagrams

Abstract: In thie paper,w ed escribe a proposal for formalizing data flowd iagrams through extended Petri nets. We illustrate the usefulness of the approach by describing howi tc an be used to analyse the consistencyofrequirements specifications.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1992
1992
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…The CPN model can check system properties such as concurrency as well as show that a system behaves in the desired manner. However, these efforts have focused mainly on Structured Analysis-oriented models [23,1,15,25]; with less attention focused on UML-based object-oriented models [6,5,17,20,19,2,14,22]. [1] proposes a technique based on a formalism to define mapping from front-end informal (specification) notations to formal models.…”
Section: Related Workmentioning
confidence: 99%
“…The CPN model can check system properties such as concurrency as well as show that a system behaves in the desired manner. However, these efforts have focused mainly on Structured Analysis-oriented models [23,1,15,25]; with less attention focused on UML-based object-oriented models [6,5,17,20,19,2,14,22]. [1] proposes a technique based on a formalism to define mapping from front-end informal (specification) notations to formal models.…”
Section: Related Workmentioning
confidence: 99%
“…General formal representations of graphical designs can be found in [9,10,11]. Formal representations specific to data flow diagrams are given in [12,13]. To illustrate our multiple views analysis framework, we concentrate our discussion on two design methods.…”
Section: Formal Representations Of Graphical Designsmentioning
confidence: 99%
“…Tse's work [11], but makes the progress in dealing with disconnected decomposition. It is summarised as follows: It is assumed in the above algorithm that g is a connected net.…”
Section: • E T-outp(g) = Output(p)mentioning
confidence: 99%