Entry Badouel:1997:SPE 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{Badouel:1997:SPE,
author = "Eric Badouel and Luca Bernardinello and Philippe
Darondeau",
title = "The synthesis problem for elementary net systems is
{NP}-complete",
journal = j-THEOR-COMP-SCI,
volume = "186",
number = "1--2",
pages = "107--134",
day = "30",
month = oct,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:18 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=186&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=1997&volume=186&issue=1-2&aid=2422",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C5640 (Protocols)",
corpsource = "IRISA, Rennes, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; elementary net systems;
exponential algorithms; labelled graph; NP-complete;
Petri net; Petri nets; polynomial time; protocols; pure
place/transition nets; sequential behaviour; synthesis
problem",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- behaviour,
138(1)113,
141(1)53,
151(1)125,
152(2)251,
155(1)179,
163(1)291,
164(1)277,
166(1)101,
170(1)145,
170(1)277,
170(1)297,
173(2)393,
173(2)485,
179(1)61,
179(1)217,
183(2)229,
187(1)87,
192(2)259,
192(2)287,
192(2)315,
193(1)197,
209(1)213
- C5640,
145(1)95,
145(1)271,
149(1)179,
149(2)257,
157(2)139,
157(2)277,
162(2)245,
177(2)425,
177(2)459,
178(1)103,
186(1)199,
196(1)259
- complete, {NP}-,
198(1)211,
201(1)137
- complete;, NP-,
137(1)129,
143(2)353,
147(1)117,
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,
191(1)205,
197(1)245-2,
198(1)211
- elementary,
137(1)53,
145(1)1,
152(2)171,
157(2)185,
172(1)135,
178(1)77,
197(1)248,
201(1)171
- exponential,
154(1)23,
154(1)57,
155(1)141,
161(1)263,
168(1)3,
172(1)121,
183(2)215
- labelled,
138(2)353,
141(1)195,
150(1)77,
174(1)67,
179(1)397,
183(2)229,
192(2)201,
195(2)291,
205(1)99
- NP-complete,
137(1)129,
143(2)353,
147(1)117,
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)157,
191(1)205,
197(1)245-2,
198(1)211
- Petri,
141(1)195,
147(1)117,
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,
194(1)241,
194(1)241,
198(1)211,
202(1)127,
206(1)219,
216(1)1,
222(1)187
- place/transition,
141(1)195,
153(1)171,
153(1)271
- protocol,
138(2)315,
145(1)95,
145(1)271,
149(1)179,
149(2)257,
154(1)57,
156(1)99,
157(2)139,
157(2)277,
162(2)245,
170(1)47,
177(2)425,
177(2)459,
178(1)103,
181(2)317,
186(1)199,
188(1)117,
190(2)363,
196(1)259,
220(1)93
- pure,
166(1)101,
173(2)349,
183(2)187,
192(1)107,
193(1)181
- sequential,
138(2)243,
138(2)273,
138(2)315,
140(2)291,
152(2)219,
160(1)1,
162(2)297,
163(1)211,
165(1)75,
168(1)121,
169(1)39,
174(1)269,
177(1)3,
177(1)59,
177(2)329,
178(1)237,
179(1)61,
191(1)131,
192(2)233,
192(2)259,
194(1)245,
196(1)71,
197(1)189,
221(1)251
- synthesis,
138(1)35,
138(1)141,
138(1)201,
138(1)211,
141(1)283,
157(1)101,
157(1)129
- {NP}-complete,
198(1)211,
201(1)137