Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paul T. Ward

dblp:50/439 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design › software design notation
data flow diagram
0.011986
The Transformation Schema: An Extension of te Data Flow Diagram to Represent Control and Timing · IEEE Trans. Software Eng. 1986

Methods — techniques the papers use, named apart from their topics

state transition modeling · 0.0execution rules · 0.0
YearPublicationVenuePosition
1989 Embedded behavior pattern languages: A contribution to a taxonomy of case languages
Paul T. Ward
J. Syst. Softw.1
1986 The Transformation Schema: An Extension of te Data Flow Diagram to Represent Control and Timing
abstract
The data flow diagram has been extensively used to model the data transformation aspects of proposed systems. However, previous definitions of the data flow diagram have not provided a comprehensive way to represent the interaction between the timing and control aspects of a system and its data transformation behavior. An extension of the data flow diagram called the transformation schema is described. This schema provides a notation and formation rules for building a comprehensive system model, and a set of execution rules to allow prediction of the behavior over time of a system modeled in this way. The notation and formation rules allow depiction of a system as a network of potentially concurrent `centers of activity' (transformations), and of data repositories (stores), linked by communication paths (flows). The execution rules provide a qualitative prediction rather than a quantitative one, describing the acceptance of inputs and the production of outputs by the transformations but not input and output values.
Paul T. Ward
IEEE Trans. Software Eng.1