%PDF-1.5 % 4 0 obj << /S /GoTo /D (section.1) >> endobj 7 0 obj (Introduction) endobj 8 0 obj << /S /GoTo /D (section.2) >> endobj 11 0 obj (Previous work and future directions) endobj 12 0 obj << /S /GoTo /D (section.3) >> endobj 15 0 obj (Preliminaries) endobj 16 0 obj << /S /GoTo /D (subsection.3.1) >> endobj 19 0 obj (Chemical reaction networks) endobj 20 0 obj << /S /GoTo /D (subsection.3.2) >> endobj 23 0 obj (Algebra) endobj 24 0 obj << /S /GoTo /D (subsection.3.3) >> endobj 27 0 obj (Stable decidability of predicates) endobj 28 0 obj << /S /GoTo /D (section.4) >> endobj 31 0 obj (Speed fault free CRDs) endobj 32 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 35 0 obj (Positive results: detection predicates are stably decidable by speed fault free CRDs) endobj 36 0 obj << /S /GoTo /D (subsection.4.2) >> endobj 39 0 obj (Negative results: speed fault free CRDs stably decide only detection predicates) endobj 40 0 obj << /S /GoTo /D (subsubsection.4.2.1) >> endobj 43 0 obj (Pumpable sets of species and -friendly paths) endobj 44 0 obj << /S /GoTo /D (subsubsection.4.2.2) >> endobj 47 0 obj (Parallel decomposition) endobj 48 0 obj << /S /GoTo /D (subsubsection.4.2.3) >> endobj 51 0 obj (Simplified proof for leaderless CRDs) endobj 52 0 obj << /S /GoTo /D (subsubsection.4.2.4) >> endobj 55 0 obj (Reaction ordering lemma) endobj 56 0 obj << /S /GoTo /D (subsubsection.4.2.5) >> endobj 59 0 obj (Proof of the full negative result) endobj 60 0 obj << /S /GoTo /D (subsubsection.4.2.6) >> endobj 63 0 obj (Proving the \040perturbation claim \(Claim 1\)) endobj 64 0 obj << /S /GoTo /D [65 0 R /XYZ null null 1.00] >> endobj 72 0 obj << /Length 3564 /Filter /FlateDecode >> stream xڭvܶ_1KS C \ۇږc=Zi{
課fHg꠱b㟶_p/_jQ*,D#}ҡ6&
u1yGaTQqdt5i$9cnLD%WNl"4TiCcd:(kxK1k`<]W.)t~dqɋv|NjvI&0q-ud܇5"u:g|MNIWZaIhm?t`!pB>?@`-IekrGItm_Ő;uM6|!vVdQ-@\P{Y]o{Pm="%66i"@{1+yG4!اH* vlk[uD' Olu6zsN6D`>^$iP2-`heK ص˵jkkü108D
E@} 4Vcl(6YGrj,2gKr15KtaTޑJiβ@GQF&$9Xq eD,A"6[bJGj #;PC4 %Oe T=W&1}3īFXZg=geرEceg=#[V.w
D"%:02 <%sO@ fq" 1;0