Entry Finkel:1997:VIC 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{Finkel:1997:VIC,
author = "Alain Finkel and Pierre McKenzie",
title = "Verifying identical communicating processes is
undecidable",
journal = j-THEOR-COMP-SCI,
volume = "174",
number = "1--2",
pages = "217--230",
day = "15",
month = mar,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:42 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=174&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=174&issue=1-2&aid=2229",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4230 (Switching theory)",
corpsource = "Lab. d'Inf. Fondamentale et Appl. de Cachan, Ecole
Normale Superieure de Cachan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "boundedness; cycles; decidability; finite state
machines; identical communicating automata; identical
communicating process verification; initial states;
mutual exclusion; perfect unbounded one-way FIFO
channels; reachability tree finiteness; Turing
machines; undecidability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boundedness,
183(2)215
- C4230,
137(1)109,
156(1)99,
174(1)137
- channel,
192(2)201,
194(1)246,
207(1)193
- communicating,
138(2)243,
138(2)273,
138(2)315,
139(1)315,
140(1)73,
141(1)195,
146(1)25,
146(1)341,
152(2)171,
152(2)219,
152(2)251,
153(1)65,
165(2)463,
167(1)235,
168(1)53,
170(1)445,
174(1)231,
176(1)205,
177(2)287,
177(2)329,
179(1)217,
179(1)301,
189(1)179,
192(2)287,
195(2)155,
195(2)205,
198(1)99,
198(1)131,
198(1)225,
215(1)349
- cycle,
143(1)1,
143(2)189,
168(1)121,
172(1)121,
191(1)245,
194(1)241-1,
204(1)233
- decidability,
138(1)3,
139(1)1,
139(1)27,
141(1)253,
145(1)111,
146(1)243,
147(1)149,
147(1)165,
148(2)227,
148(2)281,
150(1)1,
154(1)23,
154(1)107,
155(2)321,
155(2)447,
156(1)119,
157(1)115,
158(1)161,
160(1)145,
160(1)185,
161(1)93,
161(1)141,
161(1)191,
164(1)29,
164(1)123,
164(1)141,
164(1)223,
165(2)247,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
168(2)241,
168(2)z,
170(1)1,
170(1)445,
172(1)67,
172(1)309,
174(1)269,
175(1)15,
175(1)127,
175(1)z,
176(1)67,
176(1)111,
176(1)175,
176(1)235,
179(1)301,
180(1)61,
180(1)203,
183(1)83,
183(2)215,
186(1)231,
193(1)149,
193(1)181,
193(1)197,
194(1)87,
194(1)219,
195(1)33,
195(2)113,
197(1)79,
197(1)245,
198(1)1,
215(1)169,
216(1)363
- exclusion,
153(1)95,
153(1)245,
162(2)225,
193(1)97
- FIFO,
155(1)141
- finiteness,
143(2)269,
173(1)113,
204(1)169
- Finkel, Alain,
164(1)207,
222(1)187
- identical,
154(1)57,
165(2)441,
170(1)445
- initial,
138(1)201,
143(1)93,
148(1)121,
152(1)67,
166(1)263,
174(1)157,
179(1)273
- mutual,
147(1)165,
153(1)95,
153(1)245,
162(2)225,
179(1)61,
193(1)97
- one-way,
141(1)331,
148(2)261,
156(1)281,
157(2)139,
179(1)251
- perfect,
143(2)319,
145(1)111,
145(1)381,
158(1)343,
164(1)253,
182(1)1,
197(1)247-2
- reachability,
138(1)3,
138(1)35,
147(1)117,
148(2)261,
148(2)281,
153(1)49,
165(2)391,
168(1)121,
169(2)147,
172(1)121,
174(1)97,
176(1)39,
179(1)301,
183(2)215,
198(1)211,
221(1)211
- state,
138(1)3,
138(1)101,
138(1)113,
138(1)141,
138(1)169,
138(1)201,
138(2)425,
139(1)69,
143(2)251,
146(1)109,
148(1)111,
152(2)171,
153(1)271,
154(1)57,
159(2)271,
165(2)475,
168(2)367,
168(2)405,
170(1)47,
174(1)1,
175(1)183,
176(1)39,
178(1)237,
179(1)251,
179(1)273,
179(1)397,
180(1)139,
183(2)253,
186(1)199,
192(2)259,
195(2)113,
195(2)183,
196(1)45,
197(1)241
- switching,
137(1)109,
138(1)101,
156(1)99,
156(1)263,
174(1)137,
174(1)269,
178(1)103,
178(1)237,
182(1)171,
182(1)203,
185(2)347,
188(1)117,
189(1)221,
194(1)123
- Turing,
138(1)67,
143(1)123,
143(1)159,
145(1)111,
148(1)33,
148(2)325,
158(1)193,
161(1)301,
162(1)45,
168(2)215,
168(2)241,
168(2)257,
168(2)267,
168(2)303,
168(2)321,
168(2)417,
168(2)461,
168(2)z,
172(1)135,
174(1)203,
180(1)139,
180(1)229,
180(1)341,
181(1)119,
182(1)159,
191(1)215,
192(2)315,
194(1)137,
197(1)79,
210(1)217,
217(1)3,
411(31)2999
- unbounded,
138(2)273,
161(1)141,
179(1)217
- undecidability,
138(1)35,
139(1)131,
148(2)281,
160(1)185,
164(1)29,
164(1)123,
166(1)291,
168(2)z,
174(1)269,
180(1)203,
197(1)245,
207(1)43
- undecidable,
142(2)257,
160(1)145,
176(1)67,
180(1)203,
204(1)29,
208(1)179
- verification,
138(1)169,
138(2)391,
139(1)27,
139(1)275,
140(1)95,
141(1)283,
142(2)179,
142(2)257,
149(2)361,
150(1)161,
151(1)125,
151(2)487,
152(1)139,
153(1)95,
156(1)177,
165(1)3,
165(1)57,
165(1)97,
166(1)1,
166(1)173,
167(1)193,
168(1)53,
169(1)81,
170(1)47,
170(1)245,
173(1)49,
176(1)111,
176(1)235,
177(1)183,
177(2)407,
177(2)425,
177(2)459,
178(1)237,
179(1)353,
179(1)397,
180(1)17,
180(1)309,
183(2)215,
183(2)253,
185(2)393,
186(1)135,
189(1)229,
192(1)31,
195(2)259,
216(1)213,
220(2)377
- way, one-,
141(1)331,
148(2)261,
156(1)281,
157(2)139,
179(1)251