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

James E. Coolahan Jr.

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

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

Software engineering, systems software and programming languages · 1 · 1 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.

Theoretical computer science
1 paper
Automata and formal languages · 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
Embedded and real-time systems › real-time embedded systems
time-triggered systems
0.011983
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets · IEEE Trans. Software Eng. 1983
Automata and formal languages
petri nets
0.011983
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets · IEEE Trans. Software Eng. 1983
Automata and formal languages › petri nets
timed petri nets
0.011983
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets · IEEE Trans. Software Eng. 1983

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

safeness analysis · 0.0augmented petri nets · 0.0
YearPublicationVenuePosition
1983 Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
abstract
A methodology for the statement of timing requirements is presented for a class of embedded computer systems. The notion of a "time-driven" system is introduced which is formalized using a Petri net model augmented with timing information. Several subclasses of time-driven systems are defined with increasing levels of complexity. By deriving the conditions under which the Petri net model can be proven to be safe in the presence of time, timing requirements for modules in the system can be obtained. Analytical techniques are developed for proving safeness in the presence of time for the net constructions used in the defined subclasses of time-driven systems.
James E. Coolahan Jr., Nick Roussopoulos
IEEE Trans. Software Eng.1