dds/networks-tests.rkt

80 lines
3 KiB
Racket
Raw Normal View History

#lang racket
2020-02-15 13:57:49 +01:00
;;; Tests for dds/networks.
2020-02-15 13:57:49 +01:00
2020-02-20 15:56:48 +01:00
(require rackunit graph "networks.rkt")
2020-02-15 13:57:49 +01:00
2020-02-15 20:30:46 +01:00
;;; This test case sets up the following Boolean network:
;;; x1 = x1 AND NOT x2
;;; x2 = NOT x2
(test-case "Basic definitions"
(let* ([f1 (λ (s)
(let ([x1 (hash-ref s 'x1)]
[x2 (hash-ref s 'x2)])
(and x1 (not x2))))]
[f2 (λ (s)
(let ([x2 (hash-ref s 'x2)])
(not x2)))]
[bn (make-network-from-functions `((x1 . ,f1) (x2 . ,f2)))])
2020-02-15 20:30:46 +01:00
(test-case "One-step syncronous update"
(let* ([s (make-state '((x1 . #t) (x2 . #f)))]
[new-s (update bn s '(x2 x1))])
(check-equal? (hash-ref new-s 'x1) #t)
(check-equal? (hash-ref new-s 'x2) #t)
(check-equal? (length (hash-keys new-s)) 2)))
2020-02-15 20:30:46 +01:00
(test-case "One-step asynchronous update"
(let* ([s (make-state '((x1 . #f) (x2 . #f)))]
[new-s (update bn s '(x2 x1))])
(check-equal? (hash-ref new-s 'x1) #f)
(check-equal? (hash-ref new-s 'x2) #t)
(check-equal? (length (hash-keys new-s)) 2)))))
2020-02-18 11:41:16 +01:00
(test-case "Syntactic description of Boolean networks"
(let ([s (make-state '((x . #t) (y . #f)))]
[f (update-function-form->update-function '(and x y))])
(check-equal? (f s) #f))
(let ([bn1 (network-form->network (make-hash '((a . (and a b)) (b . (not b)))))]
[bn2 (make-network-from-forms '((a . (and a b))
(b . (not b))))]
[bn3 (nn '((a . (and a b))
2020-02-18 12:36:26 +01:00
(b . (not b))))]
2020-02-18 12:39:11 +01:00
[s (st '((a . #t) (b . #t)))])
(check-equal? ((hash-ref bn1 'a) s) #t)
2020-02-18 12:36:26 +01:00
(check-equal? ((hash-ref bn2 'a) s) #t)
(check-equal? ((hash-ref bn3 'a) s) #t)))
2020-02-20 15:17:32 +01:00
(test-case "Inferring interaction graphs"
2020-02-20 15:56:48 +01:00
(let* ([n #hash((a . (+ a b c))
(b . (- b c)))]
[ig (build-interaction-graph n)])
2020-02-20 15:17:32 +01:00
(check-true (set=? (list-interactions n 'a) '(a b)))
2020-02-20 15:56:48 +01:00
(check-true (set=? (list-interactions n 'b) '(b)))
(check-true (has-vertex? ig 'a))
(check-true (has-vertex? ig 'b))
(check-false (has-vertex? ig 'c))
(check-true (has-edge? ig 'a 'a))
(check-true (has-edge? ig 'b 'a))
(check-true (has-edge? ig 'b 'b))
(check-false (has-edge? ig 'c 'b))
2020-02-22 22:27:40 +01:00
(check-false (has-edge? ig 'c 'a)))
(check-equal? (map hash->list (build-all-states '((a . (#t #f)) (b . (1 2 3)))))
'(((a . #t) (b . 1))
((a . #t) (b . 2))
((a . #t) (b . 3))
((a . #f) (b . 1))
((a . #f) (b . 2))
((a . #f) (b . 3))))
(check-equal? (map hash->list (build-all-states-same-domain '(a b) '(#t #f)))
'(((a . #t) (b . #t))
((a . #t) (b . #f))
((a . #f) (b . #t))
2020-02-23 00:04:19 +01:00
((a . #f) (b . #f))))
(let ([n #hash((a . (not b)) (b . a))]
[doms (make-immutable-hash (for/list ([var '(a b)]) (cons var '(#f #t))))])
(check-equal? (get-interaction-sign n doms 'a 'b) '+)
(check-equal? (get-interaction-sign n doms 'b 'a) '-)))