Transition Nets
Transition Nets is a formal computational model within the class of Petri Nets that specifically characterizes system dynamics through directed bipartite graphs where transitions represent occurrences of discrete events that transform system states by consuming and producing tokens in places.
314
Publications
13.7K
Citations
529
Authors
279
Institutions
Publications per year
2017–2026
29
Parents
314
An Algorithm for the General Petri Net Reachability Problem
Ernst Mayr · SIAM Journal on Computing · 1984 · 457 citations
The non-sequential behaviour of Petri nets
Ursula Goltz, Wolfgang Reisig · Information and Control · 1983 · 295 citations
1–5 of 314
529
15
h-index
11
h-index
8
h-index
8
h-index
6
h-index
1–5 of 529
279

Centre National de la Recherche Scientifique
Paris, France
16 h-index
33 publications
802 citations

University of Cagliari
Cagliari, Italy
15 h-index
36 publications
2.6K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
14 h-index
17 publications
665 citations

University of Pisa
Pisa, Italy
10 h-index
21 publications
947 citations

Xidian University
Xi'an, China
9 h-index
18 publications
750 citations

Newcastle University
Newcastle upon Tyne, United Kingdom
8 h-index
12 publications
667 citations
New Jersey Institute of Technology
Newark, United States
8 h-index
9 publications
317 citations

Aarhus University
Aarhus, Denmark
7 h-index
9 publications
1.7K citations
1–8 of 279
15 publications · 1.6K citations
12
h-index
10 publications · 620 citations
10
h-index
9 publications · 767 citations
9
h-index
7 publications · 320 citations
7
h-index
ENTCS · 6 publications · 167 citations
6
h-index
1–5