Entry Hartonas:1997:SFD 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{Hartonas:1997:SFD,
author = "Chrysafis Hartonas",
title = "Semantics for finite delay",
journal = j-THEOR-COMP-SCI,
volume = "176",
number = "1--2",
pages = "205--234",
day = "20",
month = apr,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:48 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=176&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=176&issue=1-2&aid=2298",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210L (Formal
languages and computational linguistics); C4240P
(Parallel programming and algorithm theory)",
corpsource = "COGS, Sussex Univ., Brighton, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic theory; anti foundation axiom; anti founded
model; calculus of communicating systems; computational
linguistics; equivalence classes; fair bisimilarity;
fairness; finite delay operator; finite delay
semantics; fortification; fully abstract model; guarded
recursion; process equivalence; recursive equations;
SCCS; unique fixpoint theorem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- abstract,
138(1)211,
139(1)69,
140(1)95,
140(1)139,
142(1)125,
148(1)171,
149(1)151,
149(1)179,
149(2)201,
151(1)207,
152(2)269,
154(2)307,
154(2)379,
155(1)39,
156(1)177,
159(2)245,
159(2)355,
162(1)79,
162(2)173,
165(1)133,
165(1)201,
168(1)155,
169(1)113,
173(1)49,
173(2)349,
173(2)513,
176(1)1,
177(1)139,
177(1)183,
177(2)407,
179(1)217,
182(1)145,
183(2)281,
192(2)259,
194(1)240,
197(1)241,
197(1)244-2,
199(1)145,
202(1)163,
216(1)109,
216(1)159,
221(1)295,
222(1)77,
222(1)153,
228(1)105
- axiom,
137(2)237,
138(1)113,
138(1)169,
139(1)275,
146(1)25,
152(1)91,
167(1)3,
177(1)217,
177(2)287,
177(2)425,
179(1)1,
187(1)105,
191(1)1,
195(1)61
- bisimilarity,
148(2)281,
158(1)143,
177(2)487,
179(1)397,
195(2)155,
198(1)159,
228(1)5
- class,
139(1)187,
140(1)179,
140(2)291,
141(1)175,
143(1)149,
144(1)251,
145(1)111,
148(2)207,
149(2)201,
149(2)299,
150(1)1,
151(2)385,
152(1)67,
152(2)251,
153(1)49,
154(1)23,
154(2)145,
154(2)307,
154(2)367,
155(1)111,
155(1)141,
155(2)447,
157(2)227,
158(1)193,
158(1)221,
158(1)361,
160(1)305,
161(1)263,
161(1)301,
161(1)307,
162(1)5,
163(1)245,
163(1)283,
164(1)287,
165(2)355,
167(1)171,
170(1)407,
172(1)43,
172(1)91,
174(1)67,
174(1)231,
174(1)269,
176(1)39,
177(1)59,
177(1)139,
178(1)37,
179(1)217,
180(1)139,
180(1)155,
180(1)217,
180(1)325,
183(1)93,
185(1)159,
185(1)177,
186(1)231,
188(1)79,
188(1)101,
190(1)87,
191(1)215,
194(1)137,
194(1)246,
195(1)33,
195(2)113,
195(2)183,
195(2)205,
197(1)247,
198(1)225,
203(1)123,
207(1)217,
209(1)225,
211(1)253,
226(1)29,
234(1)323
- 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)217,
174(1)231,
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
- delay,
162(2)323,
178(1)119,
191(1)61,
195(2)155,
196(1)131,
196(1)131-1,
198(1)131,
204(1)11,
205(1)297
- equation,
138(1)67,
143(1)51,
144(1)59,
144(1)161,
145(1)71,
147(1)267,
151(1)257,
153(1)49,
154(1)3,
155(1)221,
155(1)267,
157(1)3,
157(1)79,
157(1)115,
157(1)z,
162(2)225,
168(1)105,
170(1)349,
173(1)183,
176(1)347,
177(1)217,
177(2)407,
179(1)217,
180(1)287,
186(1)83,
187(1)3,
187(1)7,
187(1)27,
187(1)49,
187(1)81,
187(1)87,
187(1)179,
187(1)263,
187(1)z,
191(1)145,
192(1)3,
193(1)113,
196(1)395,
197(1)247,
216(1)395,
224(1)215,
225(1)149
- fair,
139(1)27,
139(1)243,
139(1)315,
177(1)139
- fairness,
146(1)199,
152(2)219,
153(1)245,
177(1)139,
183(2)229,
189(1)109,
197(1)1,
198(1)131
- fixpoint,
138(1)141,
149(1)67,
160(1)283,
169(2)201,
176(1)283,
177(1)27,
178(1)237,
190(2)317,
194(1)241,
195(2)133,
198(1)131
- foundation,
135(1)67,
146(1)199,
183(2)253,
185(2)319,
192(2)315,
193(1)149,
194(1)242,
219(1)95
- founded,
158(1)117,
166(1)221
- fully,
138(2)315,
149(2)201,
151(1)207,
154(2)379,
156(1)177,
165(2)407,
168(1)155,
170(1)445,
179(1)217,
185(2)259,
197(1)241,
228(1)105
- guarded,
139(1)315
- Hartonas, Chrysafis,
198(1)131,
202(1)193
- operator,
138(1)141,
138(1)211,
138(2)273,
138(2)315,
138(2)425,
139(1)1,
142(1)3,
144(1)125,
147(1)149,
148(2)261,
149(2)201,
150(1)161,
151(1)3,
151(1)207,
152(2)285,
154(2)307,
155(1)39,
155(1)111,
157(1)3,
160(1)217,
160(1)271,
166(1)49,
169(1)113,
170(1)83,
170(1)145,
171(1)281,
173(1)209,
173(2)393,
176(1)1,
177(2)351,
183(2)187,
192(2)233,
194(1)1,
222(1)77
- recursion,
138(2)391,
146(1)269,
149(1)3,
151(1)207,
151(1)z,
152(2)251,
160(1)1,
162(1)23,
163(1)245,
163(1)269,
169(1)113,
169(2)201,
170(1)145,
176(1)111,
177(1)3,
177(2)329,
177(2)351,
187(1)203,
193(1)129,
198(1)131,
210(1)121,
212(1)157
- recursive,
139(1)315,
139(1)355,
141(1)151,
143(2)251,
144(1)221,
146(1)69,
146(1)243,
146(1)269,
147(1)19,
149(1)101,
151(1)207,
152(1)1,
152(2)285,
154(2)307,
156(1)177,
161(1)123,
161(1)235,
162(1)5,
162(1)23,
162(1)45,
163(1)269,
163(1)309,
164(1)13,
165(2)325,
169(1)113,
170(1)349,
175(1)127,
181(1)45,
181(1)119,
181(1)141,
185(1)129,
190(1)61,
191(1)145,
191(1)215,
193(1)113,
193(1)129,
194(1)241,
197(1)139,
201(1)63,
208(1)33,
210(1)99,
219(1)3
- SCCS,
198(1)131
- unique,
145(1)329,
147(1)69,
172(1)309