Boundedness Analysis
Boundedness Analysis is a formal method in the theory of Petri Nets that determines whether the number of tokens in any place remains bounded by a finite number across all reachable states, thereby distinguishing Petri Net systems according to their capacity to prevent unbounded accumulation of resources.
1.5K
Publications
80.1K
Citations
2.7K
Authors
1.1K
Institutions
Publications per year
2017–2026
456
Parents
1.5K
Dynamic surface control for a class of nonlinear systems
D. Swaroop, J. Karl Hedrick, Pak Yip et al. · IEEE Transactions on Automatic Control · 2000 · 2.4K citations
1–5 of 1.5K
2.7K
25
h-index
14
h-index
12
h-index
University of California, Santa Barbara, United States
10 publications · 1.3K citations
10
h-index
10
h-index
1–5 of 2.7K
1.1K

Brunel University of London
London, United Kingdom
25 h-index
30 publications
2.8K citations

Southeast University
Nanjing, China
23 h-index
43 publications
3.1K citations

Harbin Institute of Technology
Harbin, China
21 h-index
59 publications
4.4K citations
Shandong University of Science and Technology
Qingdao, China
18 h-index
27 publications
2.3K citations

University of Science and Technology Beijing
Beijing, China
17 h-index
31 publications
3.9K citations

University of Electronic Science and Technology of China
Chengdu, China
17 h-index
43 publications
4.3K citations

Beihang University
Beijing, China
16 h-index
34 publications
1.7K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
34 publications
722 citations
1–8 of 1.1K
80 publications · 10.9K citations
42
h-index
27 publications · 2.1K citations
21
h-index
32 publications · 1.2K citations
20
h-index
20 publications · 1.8K citations
19
h-index
IJRCEA · 36 publications · 1.3K citations
18
h-index
1–5