WHEN RULE-BASED MODELS NEED TO COUNT Pierre Boutillier - Ioana - - PowerPoint PPT Presentation

when rule based models need to count
SMART_READER_LITE
LIVE PREVIEW

WHEN RULE-BASED MODELS NEED TO COUNT Pierre Boutillier - Ioana - - PowerPoint PPT Presentation

K S a i p pa m WHEN RULE-BASED MODELS NEED TO COUNT Pierre Boutillier - Ioana Cristescu - Walter Fontana http://kappalanguage.org 1 KAPPA MIXTURE y y P EGFR EGF EGFR l c r c r y P EGFR EGF EGF y c r l l EGFR y EGF


slide-1
SLIDE 1

WHEN RULE-BASED MODELS NEED TO COUNT

Pierre Boutillier - Ioana Cristescu - Walter Fontana http://kappalanguage.org

K

a

S

p m i pa

1

slide-2
SLIDE 2

KAPPA MIXTURE

EGFR EGFR EGFR EGFR P P EGFR EGFR EGFR EGF EGF EGF EGF EGF EGF EGF EGF y c r y c r y c r y r y c r y c r y c r l l l l l l l c l P

2

slide-3
SLIDE 3

EGFR y r EGFR y r EGF l EGF l P @ k

EGFR c r EGFR c r EGF l EGFR c r EGFR c r EGF l @ k’

A KAPPA MODEL

3

slide-4
SLIDE 4

EGFR y r EGFR y r EGF l EGF l P @ k c c

EGFR c r EGFR c r EGF l EGFR c r EGFR c r EGF l @ k’ y y y y

PATTERNS VS SPECIES

4

slide-5
SLIDE 5

EGF l EGFR y r c EGF l EGFR y r c EGFR y c r EGF l EGFR y r c EGFR y c r P EGF l EGFR y r c EGFR y c r EGF l EGF l EGFR y r c EGFR y c r P EGF l

A B C D E

EGFR y r EGFR y r EGF l EGF l P @ k c c

5

slide-6
SLIDE 6

EGFR c r EGFR c r EGF l EGFR c r EGFR c r EGF l @ k’ EGFR c r EGFR c r EGF l EGFR c r EGFR c r EGF l

slide-7
SLIDE 7

DISTINCT SITES

7

slide-8
SLIDE 8

CASE STUDY

8

slide-9
SLIDE 9

COUNTERS

  • Declaration: C(p: 0 += 8)
  • Equality test: C(p: 1)
  • Inequality test: C(p:> 2)
  • Increment/Decrement:

C(p += -1)

9

slide-10
SLIDE 10

COUNTERS MACHINERY

A c succ n p succ n p A c succ n p succ n p succ p

10

A c succ p A c succ p succ n p Incr Decr

slide-11
SLIDE 11

EFFICIENCY

  • 2

3 4 5 6 7 8 9 10 11 12 0.5 1.0 2.0 5.0 10.0 20.0 50.0 200.0

10^5 events simulation

nb phos site time

  • 2

3 4 5 6 7 8 9 10 11 12 0.5 1.0 2.0 5.0 10.0 20.0 50.0 200.0

  • 2

3 4 5 6 7 8 9 10 11 12 0.5 1.0 2.0 5.0 10.0 20.0 50.0 200.0

  • 2

3 4 5 6 7 8 9 10 11 12 0.5 1.0 2.0 5.0 10.0 20.0 50.0 200.0 KaSim 3 counters KaSim 3 no counters KaSim 4 counters KaSim 4 no counters

11

slide-12
SLIDE 12

THOUGHTS ON TRIVIALITY

  • a posteriori triviality is not a priory triviality
  • an easy encoding is not an easy language

extension

12