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.

R. L. Sprattling

dblp:186/3202 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1986
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

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.

Computer networks
1 paper
Network performance modeling · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
local area network performance
0.011986
Real-time performance evaluation of Local Area Networks used in automated manufacturing systems · ICRA 1986
Embedded and real-time systems
manufacturing systems
0.011986
Real-time performance evaluation of Local Area Networks used in automated manufacturing systems · ICRA 1986
Embedded and real-time systems
real-time communication
0.011986
Real-time performance evaluation of Local Area Networks used in automated manufacturing systems · ICRA 1986

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

timed concurrent finite state machines · 0.0petri nets · 0.0
YearPublicationVenuePosition
1986 Real-time performance evaluation of Local Area Networks used in automated manufacturing systems
abstract
As flexible manufacturing systems (FMS) become a reality, the need for efficient, reliable, yet inexpensive, distributed communications becomes crucial. Local Area Networks (LANs), such as MAP, are rapidly emerging as the logical choice for integrating the process level of the automated factory. What makes the performance analysis and design of these networks unique, is the nature of the traffic being carried. Data traffic used for control must meet stringent real-time requirements, which are unlike the time variations accepted for the time-sharing use of a LAN. In this paper, we use a subclass of Petri nets to model the dynamic performance of the automated factory LAN. This subclass, which can be best described as timed concurrent finite state machines, gives the FMS designer the ability to model the various asynchronous, concurrent control processes and carry out a dynamic performance evaluation.
T. H. Klotz, R. G. Phillips, R. L. Sprattling, H. A. Sutherland
ICRA3