Entry Davies:1995:BHT 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{Davies:1995:BHT,
author = "Jim Davies and Steve Schneider",
title = "A brief history of {Timed CSP}",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "243--271",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=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=1995&volume=138&issue=2&aid=1803",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Dept. of Comput. Sci., Reading Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communicating sequential processes; compositional
proof system; theorem proving; timed CSP; timed models;
timed process algebras; timed refinement; untimed
models",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- communicating,
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,
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
- compositional,
140(1)95,
149(2)201,
165(1)133,
183(2)253,
183(2)281,
192(2)259,
194(1)241-3,
216(1)271
- CSP,
138(2)273,
138(2)315,
177(2)329,
179(1)333,
211(1)85
- history,
145(1)291
- proof,
135(1)67,
138(1)113,
139(1)355,
140(1)95,
141(1)69,
150(1)161,
151(1)3,
151(2)487,
152(2)219,
153(1)49,
155(2)439,
165(1)3,
165(1)75,
165(1)171,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
169(1)3,
170(1)1,
170(1)129,
170(1)407,
173(2)311,
173(2)393,
175(1)29,
175(1)159,
176(1)159,
176(1)283,
177(2)487,
178(1)257,
179(1)103,
179(1)137,
179(1)333,
180(1)309,
180(1)371,
181(2)317,
183(2)253,
184(1)1,
185(2)319,
188(1)211,
189(1)71,
190(1)41,
191(1)37,
191(1)215,
193(1)53,
194(1)244-3,
194(1)247-2,
194(1)z,
197(1)242-3,
197(1)245-1,
197(1)245-2,
197(1)246-1,
197(1)246-2,
197(1)247-2,
198(1)201,
206(1)257,
206(1)331,
206(1)353,
212(1)141,
215(1)329,
216(1)271,
216(1)395,
227(1)299,
227(1)333
- proving,
138(1)101,
138(1)169,
139(1)355,
141(1)69,
142(2)209,
142(2)229,
142(2)257,
142(2)299,
145(1)111,
146(1)185,
146(1)199,
151(1)3,
151(2)487,
153(1)49,
154(1)3,
155(2)291,
155(2)439,
165(1)3,
165(1)57,
166(1)173,
166(1)291,
167(1)193,
169(1)3,
170(1)129,
170(1)245,
170(1)407,
172(1)1,
173(1)235,
173(1)283,
173(2)311,
173(2)393,
176(1)159,
177(1)183,
179(1)103,
180(1)371,
181(2)317,
183(2)187,
183(2)253,
189(1)71,
192(1)55,
194(1)244-3,
194(1)247-2,
197(1)245,
197(1)245-1,
197(1)246-1,
197(1)247-2,
198(1)201,
206(1)163,
206(1)341,
208(1)149
- refinement,
138(2)425,
140(1)95,
143(2)269,
149(2)333,
150(1)111,
150(1)161,
159(2)245,
165(1)201,
177(1)111,
192(2)233,
194(1)241,
194(1)241-3,
202(1)127
- sequential,
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,
186(1)107,
191(1)131,
192(2)233,
192(2)259,
194(1)245,
196(1)71,
197(1)189,
221(1)251
- timed,
138(1)169,
138(2)273,
138(2)315,
152(2)251,
170(1)1,
189(1)229,
202(1)127,
211(1)85,
211(1)253
- untimed,
138(2)273,
170(1)1