Entry Esparza:1992:PTA from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Esparza:1992:PTA,
author = "J. Esparza and M. Silva",
title = "A polynomial-time algorithm to decide liveness of
bounded free choice nets",
journal = j-THEOR-COMP-SCI,
volume = "102",
number = "1",
pages = "185--205",
day = "03",
month = aug,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Inst. fur Inf., Hildesheim Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded free choice nets; concurrency control;
deadlocks; linear algebraic calculation; linear
programming; liveness; Petri nets; polynomial time
algorithm; program verification; traps",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bounded,
70(2)261,
72(1)65,
74(3)313,
76(1)143,
80(2)289,
82(1)1,
82(1)51,
84(1)53,
84(2)199,
84(2)265,
87(2)287,
94(1)125,
97(1)1,
100(2)347,
101(2)161,
112(2)419,
117(1)137,
119(1)187,
123(1)139,
132(1)85,
133(1)165
- C1180,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
99(1)157,
102(2)253,
106(2)361,
107(1)145,
110(1)215,
123(1)9,
125(1)17,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263
- C4240P,
88(1)59,
88(2)191,
90(1)127,
90(1)151,
90(1)171,
90(1)185,
91(1)1,
91(2)129,
91(2)205,
91(2)239,
92(1)3,
92(1)19,
92(1)33,
92(1)87,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
92(2)301,
92(2)309,
92(2)319,
93(2)169,
93(2)245,
94(1)141,
94(2)237,
94(2)335,
95(1)169,
95(2)207,
95(2)231,
95(2)245,
95(2)323,
96(1)157,
96(1)217,
96(2)305,
96(2)345,
96(2)411,
97(1)1,
97(1)67,
97(1)105,
97(1)131,
98(2)249,
98(2)263,
99(2)279,
99(2)335,
100(1)1,
100(1)45,
100(1)105,
100(1)157,
100(1)185,
100(1)205,
100(1)253,
100(2)365,
101(1)133,
101(2)177,
101(2)289,
101(2)337,
102(1)1,
102(1)135,
102(1)165,
102(2)355,
104(2)207,
104(2)285,
106(2)361,
107(1)77,
108(2)291,
108(2)331,
112(1)5,
114(1)31,
114(1)63,
114(1)119,
114(1)173,
114(1)z,
120(2)261,
120(2)303,
125(1)3,
125(2)373,
127(1)53,
127(1)99,
127(1)123,
127(1)181,
128(1)75,
129(2)293,
130(1)49,
130(1)175,
131(1)139,
132(1)403,
134(2)493,
135(1)5,
135(2)171,
135(2)289,
135(2)377,
136(2)527
- calculation,
79(1)241
- choice,
99(1)105,
101(2)161,
103(2)395,
122(1)137,
124(2)273,
129(2)385,
133(2)341
- concurrency,
71(1)133,
74(2)121,
74(2)199,
75(1)15,
75(3)223,
76(2)179,
90(1)127,
90(1)151,
91(1)23,
95(1)1,
96(1)3,
96(1)35,
96(1)73,
96(1)z,
101(2)161,
101(2)289,
102(1)165,
103(1)51,
112(1)5,
113(2)231,
113(2)293,
114(1)z,
118(1)21,
128(1)211,
132(1)179,
133(2)341,
135(1)5,
135(2)171,
135(2)289
- control,
71(2)193,
71(2)209,
74(2)199,
75(1)15,
79(1)163,
81(2)269,
87(1)43,
90(1)47,
90(1)127,
90(1)151,
92(1)49,
93(2)227,
95(1)1,
96(1)3,
96(1)35,
96(1)73,
96(1)z,
98(2)289,
102(1)165,
103(2)235,
104(2)235,
113(2)231,
113(2)293,
128(1)179,
133(2)341
- deadlock,
86(1)3,
87(1)97,
94(1)141,
105(1)85
- decide,
99(1)79,
110(2)419
- free,
70(2)179,
71(2)265,
72(1)65,
73(1)81,
73(3)335,
74(1)3,
74(2)121,
78(2)319,
79(1)227,
79(1)241,
86(2)233,
92(1)77,
92(2)249,
92(2)269,
94(2)199,
94(2)367,
97(1)67,
97(2)301,
98(1)5,
98(1)79,
98(1)115,
99(2)231,
100(1)67,
100(2)267,
101(2)161,
103(1)25,
103(1)51,
108(1)z,
112(2)311,
115(2)359,
116(2)421,
117(1)91,
117(1)217,
119(2)363,
121(1)309,
123(2)427,
125(2)167,
126(2)237,
134(1)3,
134(1)107,
134(1)209,
134(2)537
- liveness,
80(2)263,
82(2)253,
101(2)289,
114(1)93
- net,
71(1)133,
74(1)71,
74(2)199,
77(3)321,
80(1)1,
80(1)77,
80(2)263,
80(2)337,
82(2)341,
91(2)205,
91(2)285,
93(2)185,
95(1)159,
96(1)3,
96(1)175,
96(1)z,
96(2)285,
98(2)199,
99(1)79,
101(2)161,
102(1)165,
103(1)51,
103(2)335,
104(2)207,
109(1)257,
113(2)231,
113(2)371,
114(1)93,
115(1)3,
122(1)165,
124(1)169,
127(1)149,
131(2)331,
132(1)113,
134(1)51,
134(1)87,
135(1)111,
135(1)z,
135(2)361,
135(2)377,
182(1)257
- optimisation,
76(1)143,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
99(1)157,
102(2)253,
104(2)285,
106(2)361,
107(1)145,
110(1)215,
123(1)9,
125(1)17,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263,
134(2)559
- Petri,
71(1)133,
74(1)71,
74(2)199,
77(3)321,
80(1)1,
80(1)77,
80(2)263,
82(2)341,
91(2)205,
91(2)285,
93(2)185,
95(1)159,
96(1)3,
96(1)175,
96(1)z,
96(2)285,
98(2)199,
99(1)79,
101(2)161,
102(1)165,
103(1)51,
103(2)335,
104(2)207,
109(1)257,
113(2)231,
114(1)93,
122(1)165,
124(1)169,
127(1)149,
134(1)87,
135(2)361,
135(2)377
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- traps,
101(2)161
- verification,
70(1)127,
71(2)265,
74(3)253,
79(2)295,
79(2)323,
80(2)263,
80(2)319,
88(1)15,
89(1)179,
90(1)37,
94(1)141,
94(2)237,
94(2)335,
96(1)157,
97(1)67,
101(2)289,
101(2)337,
102(1)165,
103(2)191,
104(1)89,
105(1)129,
106(1)3,
107(2)305,
111(1)125,
112(1)145,
118(2)99,
119(1)23,
119(1)127,
119(1)173,
119(1)z,
120(1)69,
120(1)83,
120(1)123,
122(1)119,
124(1)180,
126(2)143,
128(1)99,
128(1)127,
129(1)123,
131(1)95,
131(1)139,
133(2)341,
135(2)319,
135(2)345