Entry Jones:1977:CSP from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Jones:1977:CSP,
author = "N. D. Jones and L. H. Landweber and Y. E. Lien",
title = "Complexity of some problems in {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "4",
number = "3",
pages = "277--299",
month = jun,
year = "1977",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Computer Sci., Univ. of Kansas, Lawrence, KS,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; controllability;
directed graphs; k-boundedness; liveness; Petri nets;
reachability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C1160,
1(2)185,
1(3)237,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
6(3)281,
7(2)217,
8(1)13,
8(1)45,
9(2)265
- combinatorial,
1(2)95,
1(2)185,
1(3)237,
2(3)305,
2(3)339,
3(1)51,
3(2)183,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
6(3)281,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(2)265
- complexity,
1(1)13,
1(1)21,
1(1)59,
1(2)103,
1(2)161,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(3)305,
2(3)383,
2(3)397,
3(1)1,
3(1)23,
3(1)105,
3(2)213,
3(2)267,
3(3)305,
3(3)349,
4(1)23,
4(2)171,
5(2)205,
6(1)41,
6(1)93,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)273,
8(2)189,
8(2)203,
8(2)227,
8(2)239,
8(2)255,
9(1)83,
9(1)127
- computational,
1(1)13,
1(1)21,
1(2)103,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(3)305,
2(3)397,
3(1)1,
3(1)23,
3(1)105,
3(2)267,
3(3)305,
3(3)349,
4(1)23,
5(2)205,
6(1)41,
6(1)93,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)273,
8(2)189,
8(2)203,
8(2)227,
8(2)239,
8(2)255,
9(1)17,
9(1)83,
9(1)127
- directed,
1(3)237
- graph,
1(3)237,
2(3)305,
2(3)339,
3(3)371,
5(1)51,
6(1)93,
6(3)281,
9(2)265
- Jones, N. D.,
3(1)105
- mathematics,
1(2)185,
1(3)237,
2(1)9,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
5(1)51,
5(2)179,
5(2)211,
5(3)257,
6(1)69,
6(1)93,
6(3)255,
6(3)281,
7(1)25,
7(1)117,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(1)27,
9(1)99,
9(2)265
- net,
2(1)77,
3(1)85,
4(1)99,
7(3)311,
8(3)379
- Petri,
2(1)77,
3(1)85,
4(1)99,
7(3)311,
8(3)379
- problem,
1(1)77,
1(3)237,
1(4)297,
2(1)77,
2(3)361,
3(1)1,
3(1)75,
3(1)85,
3(1)105,
3(2)123,
3(2)183,
3(3)283,
3(3)293,
4(1)99,
4(2)137,
4(3)237,
4(3)245,
5(2)179,
6(1)93,
6(2)223,
6(3)317,
7(1)25,
7(2)149,
7(2)169,
8(1)1,
8(1)89,
8(2)135,
8(2)189,
9(2)173,
9(2)377
- reachability,
2(1)77,
3(1)85,
4(1)99,
8(2)135