Entry Best:1998:UNR 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{Best:1998:UNR,
author = "E. Best and M. Koutny",
title = "Using net refinement to compute the fixpoint of a
recursive expression",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "241--??",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed May 27 07:21:35 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
conflocation = "Pisa, Italy; 28 Aug.-1 Sept. 1995",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CCS-like process algebra; fixpoint; general Petri net
semantics; net refinement; Petri nets; process algebra;
recursive expression; recursive functions; relabelling;
restriction; synchronisation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxnote = "Check page numbers: duplicate in adjacent entries",
}
Related entries
- CCS-like,
195(2)155
- compute,
196(1)319
- expression,
127(2)287,
138(2)353,
139(1)315,
143(1)51,
154(1)3,
155(1)179,
155(2)291,
155(2)439,
160(1)321,
163(1)309,
178(1)1,
178(1)237,
181(1)181,
183(2)215,
187(1)231,
190(2)115,
194(1)244-3,
197(1)241,
207(1)73,
209(1)163,
215(1)69,
227(1)3
- fixpoint,
138(1)141,
149(1)67,
160(1)283,
169(2)201,
176(1)205,
176(1)283,
177(1)27,
178(1)237,
190(2)317,
195(2)133,
198(1)131
- general,
141(1)163,
147(1)149,
152(2)171,
153(1)129,
154(2)183,
154(2)283,
156(1)203,
157(2)185,
157(2)227,
160(1)283,
172(1)43,
173(1)49,
177(1)27,
177(1)155,
177(2)351,
179(1)381,
183(2)187,
187(1)221,
193(1)97,
197(1)157,
203(1)3,
205(1)1,
206(1)51,
209(1)87,
217(1)157,
227(1)99
- Petri,
141(1)195,
147(1)117,
148(2)281,
153(1)3,
153(1)49,
153(1)65,
153(1)95,
153(1)129,
153(1)171,
153(1)211,
153(1)245,
153(1)271,
154(1)107,
170(1)277,
172(1)309,
176(1)39,
179(1)203,
183(2)229,
186(1)107,
194(1)241,
198(1)211,
202(1)127,
206(1)219,
216(1)1,
222(1)187
- 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,
176(1)205,
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,
197(1)139,
201(1)63,
208(1)33,
210(1)99,
219(1)3
- refinement,
138(2)243,
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-3,
202(1)127
- relabelling,
141(1)195,
194(1)245
- restriction,
142(2)229,
148(1)93,
155(1)85,
155(1)111,
179(1)61,
180(1)139,
198(1)131,
226(1)207
- synchronisation,
149(1)179,
151(1)37,
165(2)475,
168(2)367,
188(1)45,
191(1)61
- using,
140(1)95,
142(2)299,
145(1)189,
148(1)57,
158(1)1,
170(1)245,
173(1)253,
178(1)1,
178(1)119,
185(1)47,
187(1)249,
194(1)246,
196(1)241,
199(1)145,
200(1)261,
205(1)307,
210(2)305,
218(2)233,
220(1)3,
220(1)31,
220(2)377,
222(1)153