Entry Cheng:1995:CRS from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Cheng:1995:CRS,
author = "Allan Cheng and Javier Esparza and Jens Palsberg",
title = "Complexity results for $1$-safe nets",
journal = j-THEOR-COMP-SCI,
volume = "147",
number = "1--2",
pages = "117--136",
day = "07",
month = aug,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:16 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=147&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=147&issue=1-2&aid=1865",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1-safe nets; 1-safe Petri nets; arbitrary Petri nets;
complexity results; computational complexity; deadlock;
free-choice nets; liveness; NP-complete; Petri nets;
PSPACE-complete; reachability; standard problems;
subclasses",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $1$,
145(1)271,
193(1)113,
209(1)389
- arbitrary,
134(1)51,
138(2)353,
143(2)269,
145(1)45,
146(1)145,
150(1)161,
154(2)225,
154(2)283,
154(2)307,
155(2)425,
157(2)215,
162(2)351,
194(1)240,
197(1)245
- Cheng, Allan,
183(2)229,
190(1)87
- choice, free-,
153(1)245,
198(1)211
- complete;, NP-,
137(1)129,
143(2)353,
148(1)93,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
191(1)205,
197(1)245-2,
198(1)211
- deadlock,
151(1)195,
151(1)z,
177(2)329,
215(1)225
- Esparza, Javier,
153(1)95,
198(1)211
- free-choice,
153(1)245,
198(1)211
- liveness,
179(1)397
- NP-complete,
137(1)129,
143(2)353,
147(1)137,
148(1)19,
148(1)93,
155(2)321,
161(1)289,
163(1)161,
164(1)287,
165(2)233,
175(2)309,
178(1)265,
180(1)269,
181(1)159,
181(2)267,
186(1)107,
186(1)157,
191(1)205,
197(1)245-2,
198(1)211
- Petri,
141(1)195,
148(2)281,
153(1)3,
153(1)49,
153(1)65,
153(1)95,
153(1)129,
153(1)171,
153(1)211,
153(1)245,
153(1)271,
154(1)107,
170(1)277,
172(1)309,
176(1)39,
179(1)203,
183(2)229,
186(1)107,
194(1)241,
194(1)241,
198(1)211,
202(1)127,
206(1)219,
216(1)1,
222(1)187
- PSPACE-complete,
139(1)1
- reachability,
138(1)3,
138(1)35,
148(2)261,
148(2)281,
153(1)49,
165(2)391,
168(1)121,
169(2)147,
172(1)121,
174(1)97,
174(1)217,
176(1)39,
179(1)301,
183(2)215,
198(1)211,
221(1)211
- result,
137(2)253,
141(1)69,
148(2)281,
151(2)487,
157(1)101,
160(1)321,
163(1)99,
164(1)29,
168(2)267,
169(2)161,
176(1)111,
177(1)27,
177(1)155,
179(1)397,
188(1)129,
207(1)43,
215(1)383,
225(1)113
- safe,
154(1)107,
160(1)283,
164(1)107,
190(2)241,
193(1)97,
198(1)211
- safe, 1-,
153(1)129,
183(2)229
- standard,
149(1)49,
157(1)79,
159(2)319,
160(1)1,
168(1)53,
170(1)349,
172(1)43,
173(2)445,
173(2)485,
176(1)159,
178(1)205,
179(1)301,
190(2)317,
195(1)91,
212(1)157,
224(1)291
- subclass,
153(1)271,
160(1)87,
161(1)205,
164(1)13,
197(1)189