Entry Jategaonkar:1996:DTC 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{Jategaonkar:1996:DTC,
author = "Lalita Jategaonkar and Albert R. Meyer",
title = "Deciding true concurrency equivalences on safe, finite
nets",
journal = j-THEOR-COMP-SCI,
volume = "154",
number = "1",
pages = "107--143",
day = "22",
month = jan,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:40 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
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=1996&volume=154&issue=1&aid=2073",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory); C4240C (Computational
complexity)",
conflocation = "Lund, Sweden; 5-9 July 1993",
conftitle = "ICALP 93. 20th International Colloquium on Automata,
Languages and Programming",
corpsource = "AT and T Bell Labs., Naperville, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1- safe; complete; computation theory; computation
time; computational complexity; computational
complexity bound; decidability; decidable; DEXPTIME;
EXPSPACE; finite automata; finite net; finite Petri
net; hidden transitions; history-preserving
bisimulation; interleaving equivalence; multiprocessing
programs; Petri nets; pomset-trace equivalence problem;
safe finite nets; true concurrency; true concurrency
equivalence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bisimulation,
138(2)353,
139(1)187,
140(1)53,
140(1)73,
146(1)25,
148(2)281,
152(2)251,
153(1)65,
153(1)211,
155(1)39,
168(1)53,
170(1)445,
179(1)217,
179(1)397,
183(2)215,
190(1)87,
192(2)167,
195(2)113,
195(2)155,
195(2)227,
195(2)291,
197(1)246,
198(1)225,
200(1)225,
221(1)271
- bound,
139(1)355,
140(2)265,
140(2)301,
141(1)175,
143(2)335,
145(1)45,
145(1)271,
148(1)141,
151(1)163,
154(2)165,
154(2)283,
155(2)411,
156(1)99,
156(1)315,
157(1)129,
157(2)139,
157(2)161,
157(2)185,
157(2)259,
158(1)143,
161(1)301,
162(2)341,
163(1)177,
165(2)247,
168(1)105,
172(1)1,
172(1)293,
175(2)283,
175(2)373,
179(1)251,
179(1)301,
180(1)243,
181(1)45,
181(1)119,
181(2)307,
184(1)61,
185(1)47,
188(1)59,
188(1)117,
192(1)3,
194(1)163,
196(1)153,
197(1)95,
197(1)245-2,
201(1)63,
205(1)297,
209(1)47,
209(1)141,
209(1)389,
212(1)3
- complete,
138(2)273,
138(2)391,
141(1)337,
142(2)209,
143(1)51,
145(1)147,
146(1)243,
146(1)321,
147(1)1,
147(1)69,
147(1)137,
152(2)251,
154(2)247,
154(2)283,
160(1)185,
160(1)241,
161(1)307,
164(1)141,
164(1)287,
166(1)203,
168(1)53,
168(1)155,
170(1)145,
170(1)245,
172(1)195,
176(1)89,
179(1)421,
183(2)229,
184(1)61,
184(1)237,
189(1)239,
190(2)279,
192(2)259,
192(2)315,
193(1)53,
195(1)61,
197(1)244-2,
206(1)331,
211(1)339,
220(2)363,
221(1)157
- concurrency,
138(2)425,
149(1)151,
150(1)77,
151(1)195,
151(2)353,
153(1)211,
155(1)39,
156(1)203,
165(1)201,
169(2)161,
170(1)145,
170(1)297,
170(1)445,
174(1)67,
177(1)73,
177(2)329,
179(1)61,
179(1)333,
180(1)341,
185(2)259,
190(2)363,
194(1)242,
194(1)z,
195(2)183,
197(1)1
- 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,
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)217,
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
- decidable,
139(1)1,
143(2)269,
147(1)87,
147(1)149,
147(1)165,
148(2)227,
160(1)185,
164(1)223,
165(2)247,
166(1)1,
168(2)241,
172(1)67,
176(1)111,
183(2)215,
186(1)231,
193(1)181,
195(1)33,
195(2)113,
206(1)317
- deciding,
139(1)315,
158(1)143,
170(1)445
- DEXPTIME,
198(1)99
- hidden,
141(1)283,
152(2)171,
185(1)15,
204(1)205
- interleaving,
155(1)39,
161(1)109,
170(1)297,
196(1)365,
198(1)159,
206(1)219
- multiprocessing,
140(2)319,
143(1)73,
149(2)299,
156(1)203,
162(2)245,
162(2)283,
169(1)39,
186(1)171,
197(1)171
- 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,
170(1)277,
172(1)309,
176(1)39,
179(1)203,
183(2)229,
186(1)107,
194(1)241,
194(1)241,
198(1)211,
202(1)127,
206(1)219,
216(1)1,
222(1)187
- safe,
147(1)117,
160(1)283,
164(1)107,
190(2)241,
193(1)97,
198(1)211
- transition,
138(1)35,
138(1)169,
138(1)201,
138(2)353,
138(2)391,
139(1)187,
141(1)195,
145(1)391,
146(1)109,
150(1)77,
151(1)125,
153(1)171,
153(1)211,
156(1)289,
159(2)271,
165(2)275,
173(2)513,
174(1)67,
174(1)157,
177(2)351,
179(1)217,
179(1)273,
179(1)397,
192(2)259,
194(1)246-2,
195(1)3,
195(2)291,
197(1)246,
221(1)271
- true,
140(1)5