COSC 681 HW 0912

Distributed 9/12/2016
Due  9/21/2016


Use AnyLogic to model and simulate the following problems.


(1) 
    state |  0   1
  ==============
--->  A   |  B   A
      B   |  C   B
      C   |  A   D
      D   |  -   -
      
The accept state is D

For the following strings, indicate whether the string is recognized or not:

  001
  110101
  110
  0000


(2)
The following Petri Net model for mutual exclusion for two processes:

  PN = (P, T, I, O, M0) where
  
  P = { p1, p2, p3, p4, p5, p6, p7}   -- finite set of places
  T = { t1, t2, t3, t4}               -- finite set of transitions
  I: ( P X T) -> N                    -- input function  (from place to transition)
      (p1, t1) = 1
      (p7, t1) = 1
      (p2, t2) = 1
      (p4, t3) = 1
      (p7, t3) = 1
      (p5, t4) = 1
      
  O: ( P X T) -> N                    -- output function (from transition to place)
      (p1, t2) = 1
      (p3, t2) = 1
      (p7, t2) = 1
      (p5, t3) = 1
      (p6, t4) = 1
      (p7, t4) = 1
      
  M0:  P -> N                          -- initial marking
  
  
  Give the final markings for the following initial markings:
  
    {p1, p2, p3, p4, p5, p6, p7} =  {0, 0, 0, 0, 0, 0, 1}
                                    {1, 0, 0, 0, 0, 0, 1}
                                    {1, 0, 0, 1, 0, 0, 1}
                                    {3, 1, 0, 0, 1, 2, 0}