Protocol State Machines
Protocol State Machines is a formal computational model that belongs to the class of finite state machines and is specifically differentiated by its application in representing and managing the sequential behavior and communication states of network protocols according to predefined rules and transitions.
137
Publications
6.2K
Citations
332
Authors
150
Institutions
Publications per year
2017–2026
18
137
Finite state description of communication protocols
Gregor von Bochmann · Computer Networks (1976) · 1978 · 282 citations
Prospex: Protocol Specification Extraction
Paolo Milani Comparetti, Gilbert Wondracek, Christopher Kruegel et al. · 2009 · 259 citations
Implementing TLS with Verified Cryptographic Security
Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss et al. · 2013 · 175 citations · Full text
1–5 of 137
332
7
h-index
4
h-index
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 416 citations
3
h-index
3
h-index
3
h-index
1–5 of 332
150
AT&T (United States)
Bedminster, United States
7 h-index
16 publications
1.7K citations
The University of Texas at Austin
Austin, United States
5 h-index
10 publications
262 citations
Motorola (United States)
Schaumburg, United States
4 h-index
4 publications
582 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
11 publications
497 citations
University of Maryland, College Park
College Park, United States
4 h-index
5 publications
264 citations

Uppsala University
Uppsala, Sweden
4 h-index
10 publications
194 citations
University of California, Berkeley
Berkeley, United States
3 h-index
8 publications
1.1K citations

Concordia University
Montreal, Canada
3 h-index
4 publications
170 citations
1–8 of 150
6 publications · 729 citations
6
h-index
CCR · 5 publications · 174 citations
5
h-index
TSE · 4 publications · 214 citations
4
h-index
3 publications · 253 citations
3
h-index
2 publications · 115 citations
2
h-index
1–5