Fault Diagnosis for Discrete Event Systems Using Partially Observed Petri Nets

Algorithm 1

Computation of the maximal number of flow-in.

	Input: , an observed sequence , initial marking
	Output:
	(1) for each do
	(2)  derive
	(3) end for
	(4) let i = 0,
	(5)
	(6) let
	(7) ifthen
	(8)  if transition t is enabled with the marking M then
	(9)   let , go to 8
	(10)  else
	(11)   let , go to 7
	(12)  end if
	(13) else
	(14)  let i = i+1
	(15) end if
	(16) ifthen
	(17)  go to 5
	(18) else
	(19)  let
	(20) end if
	(21) end the algorithm