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

József Harangozó

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

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

Computer networks · 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 networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
link-layer protocols
0.011977
An approach to describing a data link level protocol with a formal language · SIGCOMM 1977
Automata and formal languages
formal grammars
0.011977
An approach to describing a data link level protocol with a formal language · SIGCOMM 1977
Automata and formal languages
protocol modeling
0.011977
An approach to describing a data link level protocol with a formal language · SIGCOMM 1977
Internet architecture and protocols › link-layer protocols
HDLC
0.011977
An approach to describing a data link level protocol with a formal language · SIGCOMM 1977

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

formal grammar · 0.0finite-state automata · 0.0finite state automata · 0.0
YearPublicationVenuePosition
1977 An approach to describing a data link level protocol with a formal language
abstract
A method approaching the formal description of protocols is presented. The method -based on formal languages - utilises the relationship between the formal languages and automata and allows the dialogue between two partners/stations, units of equipments, processes, etc./ to be defined in a formal way. The paper considers a data link level protocol, the High Level Data Link Control Procedure. Two basic models are given: the first is for the description of the operation of the stations in half-duplex, the other for the full-duplex transmission mode. A number of other improved models are introduced taking into consideration the effect of time-out, unknown frame, sequence numbering and the request for retransmission frames with a sequence number. It is shown that the models can follow the way of avoiding the deadlock situation, and the formal grammars are more advantageous for modelling complicated systems than are automata. The advantages and limitations of the approach is emphasized by comparing it with approaches elaborated by other authors.
József Harangozó
SIGCOMM1