:: BOOLMARK semantic presentation
theorem Th1: :: BOOLMARK:1
theorem Th2: :: BOOLMARK:2
theorem Th3: :: BOOLMARK:3
:: deftheorem Def1 defines Bool_marks_of BOOLMARK:def 1 :
:: deftheorem Def2 defines is_firable_on BOOLMARK:def 2 :
:: deftheorem Def3 defines Firing BOOLMARK:def 3 :
:: deftheorem Def4 defines is_firable_on BOOLMARK:def 4 :
definition
let PTN be
PT_net_Str ;
let M0 be
Boolean_marking of
PTN;
let Q be
FinSequence of the
Transitions of
PTN;
func Firing c3,
c2 -> Boolean_marking of
a1 means :
Def5:
:: BOOLMARK:def 5
it = M0 if Q = {} otherwise ex
M being
FinSequence of
Bool_marks_of PTN st
(
len Q = len M &
it = M /. (len M) &
M /. 1
= Firing (Q /. 1),
M0 & ( for
i being
Element of
NAT st
i < len Q &
i > 0 holds
M /. (i + 1) = Firing (Q /. (i + 1)),
(M /. i) ) );
existence
( ( Q = {} implies ex b1 being Boolean_marking of PTN st b1 = M0 ) & ( not Q = {} implies ex b1 being Boolean_marking of PTN ex M being FinSequence of Bool_marks_of PTN st
( len Q = len M & b1 = M /. (len M) & M /. 1 = Firing (Q /. 1),M0 & ( for i being Element of NAT st i < len Q & i > 0 holds
M /. (i + 1) = Firing (Q /. (i + 1)),(M /. i) ) ) ) )
uniqueness
for b1, b2 being Boolean_marking of PTN holds
( ( Q = {} & b1 = M0 & b2 = M0 implies b1 = b2 ) & ( not Q = {} & ex M being FinSequence of Bool_marks_of PTN st
( len Q = len M & b1 = M /. (len M) & M /. 1 = Firing (Q /. 1),M0 & ( for i being Element of NAT st i < len Q & i > 0 holds
M /. (i + 1) = Firing (Q /. (i + 1)),(M /. i) ) ) & ex M being FinSequence of Bool_marks_of PTN st
( len Q = len M & b2 = M /. (len M) & M /. 1 = Firing (Q /. 1),M0 & ( for i being Element of NAT st i < len Q & i > 0 holds
M /. (i + 1) = Firing (Q /. (i + 1)),(M /. i) ) ) implies b1 = b2 ) )
correctness
consistency
for b1 being Boolean_marking of PTN holds verum;
;
end;
:: deftheorem Def5 defines Firing BOOLMARK:def 5 :
theorem Th4: :: BOOLMARK:4
canceled;
theorem Th5: :: BOOLMARK:5
theorem Th6: :: BOOLMARK:6
E103:
now
let PTN be
PT_net_Str ;
let Sd be non
empty Subset of the
Places of
PTN;
assume E22:
for
M0 being
Boolean_marking of
PTN st
M0 .: Sd = {FALSE } holds
for
t being
transition of
PTN st
t is_firable_on M0 holds
(Firing t,M0) .: Sd = {FALSE }
;
assume
not
Sd is
Deadlock-like
;
then
not
*' Sd c= Sd *'
by PETRI:def 5;
then consider t being
transition of
PTN such that E23:
t in *' Sd
and E24:
not
t in Sd *'
by SUBSET_1:7;
set M0 =
(the Places of PTN --> TRUE ) +* (Sd --> FALSE );
E25:
[#] the
Places of
PTN = the
Places of
PTN
by SUBSET_1:def 4;
(
dom (the Places of PTN --> TRUE ) = the
Places of
PTN &
dom (Sd --> FALSE ) = Sd )
by FUNCOP_1:19;
then E31:
dom ((the Places of PTN --> TRUE ) +* (Sd --> FALSE )) =
the
Places of
PTN \/ Sd
by FUNCT_4:def 1
.=
the
Places of
PTN
by , SUBSET_1:28
;
(
rng (the Places of PTN --> TRUE ) c= {TRUE } &
rng (Sd --> FALSE ) c= {FALSE } )
by FUNCOP_1:19;
then
(
rng (the Places of PTN --> TRUE ) c= BOOLEAN &
rng (Sd --> FALSE ) c= BOOLEAN )
by XBOOLE_1:1;
then E33:
(rng (the Places of PTN --> TRUE )) \/ (rng (Sd --> FALSE )) c= BOOLEAN
by XBOOLE_1:8;
rng ((the Places of PTN --> TRUE ) +* (Sd --> FALSE )) c= (rng (the Places of PTN --> TRUE )) \/ (rng (Sd --> FALSE ))
by FUNCT_4:18;
then
rng ((the Places of PTN --> TRUE ) +* (Sd --> FALSE )) c= BOOLEAN
by , XBOOLE_1:1;
then
(the Places of PTN --> TRUE ) +* (Sd --> FALSE ) in Funcs the
Places of
PTN,
BOOLEAN
by , FUNCT_2:def 2;
then reconsider M0 =
(the Places of PTN --> TRUE ) +* (Sd --> FALSE ) as
Boolean_marking of
PTN ;
E34:
M0 .: Sd = {FALSE }
by ;
Sd misses *' {t}
by , PETRI:19;
then E36:
(the Places of PTN --> TRUE ) .: (*' {t}) = M0 .: (*' {t})
by ;
E37:
rng (the Places of PTN --> TRUE ) c= {TRUE }
by FUNCOP_1:19;
(the Places of PTN --> TRUE ) .: (*' {t}) c= rng (the Places of PTN --> TRUE )
by RELAT_1:144;
then
M0 .: (*' {t}) c= {TRUE }
by , , XBOOLE_1:1;
then E38:
t is_firable_on M0
by ;
{t} *' meets Sd
by , PETRI:20;
then consider s being
set such that E39:
s in ({t} *' ) /\ Sd
by XBOOLE_0:4;
E40:
(
s in {t} *' &
s in Sd )
by , XBOOLE_0:def 3;
then
(Firing t,M0) . s = TRUE
by ;
then
TRUE in (Firing t,M0) .: Sd
by , FUNCT_2:43;
then
(Firing t,M0) .: Sd <> {FALSE }
by TARSKI:def 1;
hence
contradiction
by , Th1, ;
end;
theorem Th7: :: BOOLMARK:7
theorem Th8: :: BOOLMARK:8
theorem Th9: :: BOOLMARK:9
canceled;
theorem Th10: :: BOOLMARK:10
theorem Th11: :: BOOLMARK:11
theorem Th12: :: BOOLMARK:12
theorem Th13: :: BOOLMARK:13
theorem Th14: :: BOOLMARK:14