Entry Howell:1989:PCF from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Howell:1989:PCF,
author = "Rodney R. Howell and Louis E. Rosier",
title = "Problems concerning fairness and temporal logic for
conflict-free {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "305--329",
day = "29",
month = may,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin",
affiliationaddress = "Austin, TX, USA",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "complexity; Computer Metatheory; Computer
Programming--Theory; conflict-free Petri nets;
Conflict-Free Petri Nets; decidability; Fair
Nontermination Problem; fair nontermination problem;
fairness; finite state systems; formal logic; model
checking problem; NLOGSPACE; NP; parallel programming;
Petri nets; Programming Theory; programming theory;
PTIME; Temporal Logic; temporal logic; undecidable",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- checking,
39(2)267,
44(1)111,
46(2)197,
64(1)39
- concerning,
41(2)169,
46(2)107,
47(3)329,
66(1)45
- conflict-free,
44(3)275,
62(1)105,
62(1)221
- decidability,
35(1)1,
35(2)191,
35(2)227,
35(2)329,
35(2)337,
36(2)173,
37(2)123,
38(1)117,
39(2)281,
41(1)51,
41(1)105,
41(2)247,
44(2)199,
44(2)237,
46(1)83,
47(1)27,
47(1)39,
47(1)71,
47(2)225,
47(3)247,
48(2)257,
48(2)329,
49(1)43,
51(3)255,
52(3)177,
53(2)243,
55(1)1,
55(2)141,
58(1)231,
59(3)287,
61(2)259,
61(2)289,
64(3)343,
65(2)265,
66(1)55,
67(1)5,
67(1)19,
67(1)129,
67(2)143,
67(2)303,
68(3)267,
68(3)319,
68(3)343
- fair,
37(3)305,
45(2)193,
49(2)121,
51(1)129,
58(1)263,
59(3)235,
64(3)221,
64(3)281,
66(3)333
- fairness,
37(3)305,
38(2)193,
54(2)139,
59(3)235
- free, conflict-,
44(3)275,
62(1)105,
62(1)221
- Metatheory,
57(0)3,
58(0)3,
58(1)129,
58(1)209,
59(0)3,
59(1)25,
59(1)85,
59(1)115,
59(1)181,
59(3)211,
59(3)235,
59(3)287,
59(3)317,
60(3)231,
60(3)255,
60(3)297,
61(2)103,
61(2)199,
62(3)289,
62(3)311,
62(3)319,
63(1)1,
63(1)19,
63(1)43,
63(1)91,
63(2)113,
63(2)203,
63(3)239,
63(3)253,
63(3)275,
63(3)303,
63(3)333,
64(1)1,
64(1)15,
64(1)25,
64(1)55,
64(1)67,
64(1)97,
64(1)119,
64(3)221,
64(3)271,
64(3)281,
64(3)331,
64(3)343,
65(0)123,
65(1)1,
65(1)35,
65(1)85,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
65(2)265,
65(3)271,
65(3)291,
65(3)343,
66(0)117,
66(2)205,
67(1)19,
67(1)87
- model,
35(2)191,
37(1)77,
37(3)269,
37(3)305,
39(1)47,
39(2)107,
40(2)149,
40(2)275,
42(2)123,
43(2)213,
44(1)1,
45(1)1,
45(2)159,
47(2)111,
48(1)95,
48(1)109,
48(2)229,
48(2)297,
49(2)171,
49(2)267,
49(2)283,
51(1)129,
52(3)193,
52(3)239,
52(3)251,
54(1)65,
56(2)187,
58(1)249,
59(1)85,
59(3)277,
60(2)109,
60(3)297,
61(1)49,
61(2)149,
61(2)199,
62(3)251,
63(1)63,
63(2)203,
64(3)221,
65(1)85,
66(0)117,
66(2)205,
68(1)19,
68(2)203,
68(3)343,
69(1)1,
69(3)289
- net,
35(2)191,
39(2)107,
39(2)155,
40(2)149,
40(2)329,
41(2)185,
43(1)99,
44(3)275,
45(3)261,
55(1)87,
60(1)1,
64(1)25,
64(1)67
- NP,
37(1)1,
38(2)249,
39(2)225,
47(1)85,
47(2)169,
51(1)53,
52(1)15,
52(3)177,
68(3)267
- Petri,
39(2)107,
39(2)155,
40(2)149,
41(2)185,
43(1)99,
44(3)275,
45(3)261,
55(1)87,
60(1)1,
64(1)25,
64(1)67
- Programming--Theory,
59(0)3,
59(1)25,
62(3)289,
62(3)319,
63(1)19,
63(2)113,
63(3)253,
63(3)303,
64(3)271,
64(3)331
- PTIME,
58(1)263
- Rosier, Louis E.,
58(1)263
- state,
40(1)67,
40(2)245,
41(2)331,
44(1)69,
46(2)107,
47(2)149,
48(1)117,
52(3)269,
55(2)291,
56(1)135,
63(1)91,
64(2)203,
64(3)271,
64(3)281,
68(1)49,
68(3)253,
69(3)243
- temporal,
38(2)269,
43(2)277,
46(2)285,
47(3)329,
49(2)217,
49(2)z,
54(2)199,
56(1)135,
57(2)317,
59(0)3,
59(1)115,
65(1)35
- Theory, Programming-,
59(0)3,
59(1)25,
62(3)289,
62(3)319,
63(1)19,
63(2)113,
63(3)253,
63(3)303,
64(3)271,
64(3)331
- undecidable,
59(3)287,
67(2)143,
68(3)319