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

G. Hoffmann

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

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

Applied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › control systems
controller synthesis
0.011992
The input-output control of real-time discrete event systems · RTSS 1992

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

supervisory control theory · 0.0automata synthesis · 0.0
YearPublicationVenuePosition
1992 The input-output control of real-time discrete event systems
abstract
The authors formulate and analyze a controller synthesis problem for a plant which must meet certain hard real-time deadlines. In this timed input-output control problem, the plant is modeled by finite timed traces. The authors provide necessary and sufficient conditions for the existence of a timed input-output controller. The results are based in part on the supervisory control theory of P.J. Ramadge and W.M. Wonham. When the plant and the closed-loop specification are represented by deterministic limited automata, the synthesis problem can be solved. The synthesis procedure and the synthesized supervisor are polynomial in the number of automata states and exponential in the timing information.>
G. Hoffmann, Howard Wong-Toi
RTSS1