Skip to main content
Log in

Diagnosability analysis of patterns on bounded labeled prioritized Petri nets

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

Checking the diagnosability of a discrete event system aims at determining whether a fault can always be identified with certainty after the observation of a bounded number of events. This paper investigates the problem of pattern diagnosability of systems modeled as bounded labeled prioritized Petri nets that extends the diagnosability problem on single fault events to more complex behaviors. An effective method to automatically analyze the diagnosability of a pattern is proposed. It relies on a specific Petri net product that turns the pattern diagnosability problem into a model-checking problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  • Basile F, Chiacchio P, De Tommasi G (2012) On K-diagnosability of Petri nets via integer linear programming. Automatica 48(9):2047–2058

    Article  MathSciNet  MATH  Google Scholar 

  • Benveniste A, Fabre E, Haar S, Jard C (2003) Diagnosis of asynchronous discrete-event systems: a net unfolding approach. Trans Autom Control 48(5):714–727

    Article  MathSciNet  Google Scholar 

  • Berthomieu B, Ribet P O, Vernadat F (2004) The tool tina – construction of abstract state spaces for Petri nets and time Petri nets. Int J Prod Res 42(14):2741–2756

    Article  MATH  Google Scholar 

  • Berthomieu B, Peres F, Vernadat F (2006) Bridging the gap between timed automata and bounded time Petri nets. In: 4th International conference formal modeling and analysis of timed systems. Paris, pp 82– 97

  • Berthomieu B, Peres F, Vernadat F (2007) Model-checking bounded prioriterized time Petri nets. In: Automated technology for verification and analysis, vol 4762. Springer Verlag, LNCS, pp 523– 532

  • Cabasino MP, Giua A, Seatzu C (2009) Diagnosability of bounded Petri nets. In: Proceedings of the 48th IEEE conference on decision and control, 2009 held jointly with the 2009 28th chinese control conference. CDC/CCC 2009. IEEE, pp 1254–1260

  • Cabasino M P, Giua A, Seatzu C (2014) Diagnosability of discrete-event systems using labeled Petri nets. IEEE Trans Autom Sci Eng 11(1):144–153

    Article  Google Scholar 

  • Cimatti A, Pecheur C, Cavada R (2003) Formal verification of diagnosability via symbolic model checking. In: 18th International joint conference on artificial intelligence. Acapulco, pp 363–369

  • Clarke E M, Grumberg O, Peled DA (1999) Model checking. MIT press

  • Genc S, Lafortune S (2007) Distributed diagnosis of place-bordered Petri nets. IEEE Trans Autom Sci Eng 4(2):206–219

    Article  Google Scholar 

  • Giua A (2007) A benchmark for diagnosis. http://www.diee.unica.it/giua/WODES/WODES08/media/benchmark_diagnosis.pdf

  • Giua A, Seatzu C (2005) Fault detection for discrete event systems using Petri nets with unobservable transitions. In: 44th IEEE Conference on decision and control, 2005 and 2005 European control conference. Seville, pp 6323–6328

  • Gougam H E, Subias A, Pencolé Y (2013) Supervision patterns: formal diagnosability checking by Petri net unfolding. In: 4th IFAC Workshop on dependable control of discrete systems. York, pp 73–78

  • Grastien A (2009) Symbolic testing of diagnosability. In: International workshop on principles of diagnosis (DX-09), pp 131–138

  • Haar S, Benveniste A, Fabre E, Jard C (2003) Partial order diagnosability of discrete event systems using Petri net unfoldings. In: 42nd IEEE Conference on decision and control. Maui, pp 3748– 3753

  • Hack M (1975) Petri net languages. Tech. Rep. 124, M.I.T. Project MAC, Computation Structures Group, Massachusetts Institute of Technology

  • Jéron T, Marchand H, Pinchinat S, Cordier MO (2006) Supervision patterns in discrete event systems diagnosis. In: 8th International workshop on discrete event systems. Ann Arbor, pp 262–268

  • Jiang S, Kumar R (2004) Failure diagnosis of discrete-event systems with linear-time temporal logic specifications. Trans Autom Control 49(6):934–945

    Article  MathSciNet  Google Scholar 

  • Jiang S, Huang Z, Chandra V, Kumar R (2001) A polynomial algorithm for testing diagnosability of discrete-event systems. Trans Autom Control 46(8):1318–1321

    Article  MathSciNet  MATH  Google Scholar 

  • Lai S, Nessi D, Cabasino M P, Giua A, Seatzu C (2008) A comparison between two diagnostic tools based on automata and Petri nets. In: 9th International workshop on discrete event systems. Göteborg, pp 144–149

  • Lamperti G, Zanella M (2006) Flexible diagnosis of discrete-event systems by similarity-based reasoning techniques. Artif Intell 170(3):232–297

    Article  MathSciNet  MATH  Google Scholar 

  • Lefebvre D, Delherm C (2007) Diagnosis of DES with Petri net models. IEEE Trans Autom Sci Eng 4(1):114–118

    Article  Google Scholar 

  • Lin F (1994) Diagnosability of discrete event systems and its applications. J Discret Event Dyn Syst Theory Appl 4(2):197–212

    Article  MATH  Google Scholar 

  • Liu B (2014) An efficient approach for diagnosability and diagnosis of des based on labeled Petri nets - untimed and timed contexts. PhD thesis, Univ. Lille Nord

  • Liu B, Ghazel M, Toguyéni A (2014a) OF-PENDA: a software tool for fault diagnosis of discrete event systems modeled by labeled Petri nets. In: Proceedings of the 1st international workshop on Petri nets for adaptive discrete-event control systems (ADECS 2014), no. 1161 in CEUR Workshop Proceedings, pp 20–35

  • Liu B, Ghazel M, Toguyéni A (2014b) Toward an efficient approach for diagnosability analysis of DES modeled by labeled Petri nets. In: 13th European control conference. Strasbourg, pp 1293– 1298

  • Pencolé Y (2004) Diagnosability analysis of distributed discrete event systems. In: 16th European conference on artificial intelligence. Valencia, pp 43–47

  • Pencolé Y, Cordier M O (2005) A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks. Artif Intell 164(2):121–170

    Article  MathSciNet  MATH  Google Scholar 

  • Pencolé Y, Schumann A, Kamenetsky D (2006) Towards low-cost fault diagnosis in large component-based systems. In: 6th IFAC Symposium on fault detection, supervision and safety of technical processes. Beijing, pp 1473–1478

  • Peterson J L (1977) Petri nets. ACM Comput Surv 9(3):223–252

    Article  MathSciNet  MATH  Google Scholar 

  • Rozé L, Cordier M O (2002) Diagnosing discrete-event systems: extending the diagnoser approach to deal with telecommunication networks. J Discret-Event Dyn Syst Theory Appl (JDEDS) 12(1):43–81

    Article  MathSciNet  MATH  Google Scholar 

  • Sampath M, Sengupta R, Lafortune S, Sinnamohideen K, Teneketzis D (1995) Diagnosability of discrete-event systems. Trans Autom Control 40(9):1555–1575

    Article  MathSciNet  MATH  Google Scholar 

  • Schnoebelen P (2003) The complexity of temporal logic model checking. Adv Modal Logic 4:393–436

    MathSciNet  MATH  Google Scholar 

  • Schumann A, Pencolé Y (2007) Scalable diagnosability checking of event-driven systems. In: 20th International joint conference on artificial intelligence. Hyderabad, pp 575–580

  • Ye L, Dague P (2012) A general algorithm for pattern diagnosability of distributed discrete event systems. In: Proceedings of the 24th IEEE international conference on tools with artificial intelligence (ICTAI 2012), pp 130–137

  • Yoo T S, Lafortune S (2002) Polynomial-time verification of diagnosability of partially observed discrete-event systems. Trans Autom Control 47(9):1491–1495

    Article  MathSciNet  Google Scholar 

  • Zanella M, Lamperti G (2004) Diagnosis of discrete-event systems by separation of concerns, knowledge compilation, and reuse. In: Proceedings of the 16th European conference on artificial intelligence (ECAI04), pp 838–842

  • Zaytoon J, Lafortune S (2013) Overview of fault diagnosis methods for discrete event systems. Ann Rev Control 37:308–320

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yannick Pencolé.

Appendix: Proofs

Appendix: Proofs

1.1 A.1 Proof of Lemma 1

Lemma 1

For any reachable marking \(M \in R({\Theta }_{\Omega },M_{{\Theta }_{\Omega }0})\) of Θ Ω , there exists a reachable marking M 1 ∈ R(Θ,M Θ0 ) and a reachable marking M 2 ∈ R(Ω,M Ω0 ) such that M=M 1 ∪M 2.

Proof

We respectively denote by P Θ, T Θ, P Ω, T Ω, \(P_{{\Theta }_{\Omega }},T_{{\Theta }_{\Omega }}\) the set of places and transitions of Θ, Ω, ΘΩ. M Θ0, M Ω0 and \(M_{{\Theta }_{\Omega }0}\) are also their respective initial marking. We proceed by induction on the set of reachable markings of \(R({\Theta }_{\Omega },M_{{\Theta }_{\Omega }0})\) starting from the initial marking \(M_{{\Theta }_{\Omega }0}\). The property obviously holds for \(M_{{\Theta }_{\Omega }0}\) by definition of the system-pattern product (Definition 10).

Now suppose the existence in \(R({\Theta }_{\Omega },M_{{\Theta }_{\Omega }0})\) of a marking M such that the property holds: there exist a reachable marking \(M^{\prime }_{1} \in R({\Theta },M_{\Theta 0})\) and a reachable marking \(M^{\prime }_{2} \in R({\Omega },M_{\Omega 0})\) such that \(M^{\prime } = M^{\prime }_{1} \cup M^{\prime }_{2}\). Consider a marking M that is reachable from M : \(\exists t \in T_{{\Theta }_{\Omega }}: M^{\prime }\overset {t}{\longrightarrow }M\), it follows that \(M \in R({\Theta }_{\Omega },M_{{\Theta }_{\Omega }0})\) and \(\text {pre}_{{\Theta }_{\Omega }}(t) \subseteq M^{\prime }\). Let K Θ, K Ω respectively denote the transition mask of Θ over ΘΩ and the transition mask of Ω over ΘΩ formally defined as follows: let ε denote here the empty sequence of transitions,

$$K_{\Theta}(t) = \left\{\begin{array}{lllll} t & \text{if } t \in T_{\Theta}\\ \varepsilon & \text{if } t \in T_{\Omega}\\ t_{1} & \text{if } t = t_{1}\|t_{2} \end{array}\right. K_{\Omega}(t) = \left\{\begin{array}{lllll} \varepsilon & \text{if } t \in T_{\Theta}\\ t & \text{if } t \in T_{\Omega}\\ t_{2} & \text{if } t = t_{1}\|t_{2} \end{array}\right. $$

The transition masks can be easily extended to any sequence of transitions of ΘΩ, let s = t 0t n be such a sequence, K Θ(s) = K Θ(t 0).K Θ(t 1)…K Θ(t n ) (similar for K Ω(s)). From Definition 10, we get:

$$\text{pre}_{{\Theta}_{\Omega}}(t) = \text{pre}_{\Theta}(K_{\Theta}(t)) \cup \text{pre}_{\Omega}(K_{\Omega}(t)),$$

with the following definition extension of pre: \(\text {pre}_{{\Theta }_{\Omega }}(\varepsilon ) = \text {pre}_{\Theta }(\varepsilon ) = \text {pre}_{\Omega }(\varepsilon ) = \varnothing \). However any place of preΘ(K Θ(t)) is in P Θ and any place of preΩ(K Ω(t)) is in P Ω. As P Θ and P Ω are disjoint preΘ(K Θ(t))⊆M1′ and preΩ(K Ω(t))⊆M2′. From this, two cases hold.

  1. 1.

    Transition t = t 1t 2 is synchronized. This transition results from the synchronization of transition t 1 in Θ and transition t 2 in Ω therefore, as preΘ(K Θ(t)) = preΘ(t 1)⊆M1′, t 1 is firable from \(M^{\prime }_{1}\) in Θ and, as preΩ(K Ω(t)) = preΩ(t 2)⊆M2′, t 2 is firable from \(M^{\prime }_{2}\) in Ω. By Definition 10, \(\text {post}_{{\Theta }_{\Omega }}(t) = \text {post}_{\Theta }(t_{1}) \cup \text {post}_{\Omega }(t_{2})\).

  2. 2.

    Transition t belongs to T Θ, so t is firable from \(M^{\prime }_{1}\) in Θ and \(\text {post}_{{\Theta }_{\Omega }}(t) = \text {post}_{\Theta }(t)\).

Based on the extended definition of post: \(\text {post}_{{\Theta }_{\Omega }}(\varepsilon ) = \text {post}_{\Theta }(\varepsilon ) = \text {post}_{\Omega }(\varepsilon ) = \varnothing \), the three previous cases can be synthesized as follows:

$$\text{post}_{{\Theta}_{\Omega}}(t) = \text{post}_{\Theta}(K_{\Theta}(t)) \cup</p><p class="noindent">\text{post}_{\Omega}(K_{\Omega}(t)). $$

We have supposed that \(M^{\prime }\overset {t}{\longrightarrow }M\) so \(M = M^{\prime } \setminus \text {pre}_{{\Theta }_{\Omega }}(t) \cup \text {post}_{{\Theta }_{\Omega }}(t)\) which leads to M = M ∖(preΘ(K Θ(t))∪preΩ(K Ω(t)))∪(postΘ(K Θ(t))∪postΩ(K Ω(t))) to finally obtain M = M 1M 2 with M 1 = (M1′∖preΘ(K Θ(t)))∪postΘ(K Θ(t)) and M 2 = (M2′∖preΩ(K Ω(t)))∪postΩ(K Ω(t)). □

1.2 A.2 Proof of Theorem 1

Theorem 1

Let Θ be the LLPPN of a system over the alphabet Σ and Ω be the LLPPN of a pattern:

$$\mathcal{L}({\Theta} \ltimes {\Omega}) = \{ \rho \in \mathcal{L}({\Theta}) : \rho \Supset {\Omega} \}. $$

Proof

By Definition 5, we have to prove that \(\mathcal {L}({\Theta } \ltimes {\Omega }) \subseteq \{ \rho \in \mathcal {L}({\Theta }) : \exists \sigma \in \mathcal {L}({\Omega }): \rho \Supset \sigma \}\).

  1. 1.

    Let us prove first that \(\mathcal {L}({\Theta } \ltimes {\Omega }) \subseteq \{ \rho \in \mathcal {L}({\Theta }) : \exists \sigma \in \mathcal {L}({\Omega }): \rho \Supset \sigma \}\) . The first step is to prove that any word of \(\mathcal {L}({\Theta } \ltimes {\Omega })\) is indeed in \(\mathcal {L}({\Theta })\). By Lemma 1, recalling the transition masks K Θ and K Ω defined in the proof of this lemma, we get: \(\forall r \in {T_{{\Theta }_{\Omega }}}: M_{0} \to [r] M, \exists r_{1} \in {T_{\Theta }} = K_{\Theta }(r) : {M_{0}}_{1} \to [r_{1}] M_{1}, \exists r_{2} \in {T_{\Omega }} = K_{\Omega }(r) : {M_{0}}_{2} \to [r_{2}] M_{2} \land M = M_{1}\cup M_{2}.\) Moreover, by Definition 10, \(\ell _{{\Theta }_{\Omega }}(r) = \ell _{\Theta }(K_{\Theta }(r))\). For any firable sequence of ΘΩ, there exists a firable sequence in Θ with the same sequence of labels. As \(\mathcal {L}({\Theta })\) is a prefix-closed language (Q Θ = R(Θ, M Θ0), see Definition 3) any sequence of labels resulting from a firable sequence of Θ is in \(\mathcal {L}({\Theta })\), so \(\mathcal {L}({\Theta } \ltimes {\Omega }) \subseteq \mathcal {L}({\Theta })\).

    Consider now such a firable sequence r:M 0→[r]M of \({\Theta } \ltimes {\Omega }\) such that \(\rho = \ell _{\Theta \ltimes {\Omega }}(r) \in \mathcal {L}({\Theta } \ltimes {\Omega })\subseteq \mathcal {L}({\Theta })\). It means that there exists M 0 2→[K Ω(r)]M 2 (M 2Q Ω). Let σ = Ω(K Ω(r)) it follows that \(\sigma \in \mathcal {L}({\Omega })\). We now prove that \(\rho \Supset \sigma \). Let T s denote the set of synchronized transitions of \({\Theta } \ltimes {\Omega }\) (see Definition 10). As \(\rho \in \mathcal {L}({\Theta } \ltimes {\Omega }), \rho \not = \varepsilon \) and r contains at least one transition t s of T s . Sequence r can then be decomposed as r = r t s r′′:∀tr , tT s . Therefore, ρ can be written as Θ(K Θ(r )) Θ(K Θ(t s )) Θ(K Θ(r′′)) and σ can be written as Ω(K Ω(r )) Ω(K Ω(t s )) Ω(K Ω(r′′)). As t s is the first synchronized transition in r, Ω(K Ω(r )) = ε. Moreover, Ω(K Ω(t s )) = Θ(K Θ(t s )), which leads to σ = Θ(K Θ(t s )) Ω(K Ω(r′′)). Let \(\rho ^{\prime \prime } = \ell _{\Theta \ltimes {\Omega }}(r^{\prime \prime })\) and σ′′ = Ω(K Ω(r′′)), it follows that \(\rho \Supset \sigma \) iff \(\rho ^{\prime \prime } \Supset \sigma ^{\prime \prime }\). Two cases hold:

    1. (a)

      If r′′ does not contain some transitions of T s , it means that K Ω(r′′) is an empty sequence: Ω(K Ω(r′′)) = ε, so σ′′ = ε and, by Definition 6, \(\rho ^{\prime \prime } \Supset \sigma ^{\prime \prime }\).

    2. (b)

      If r′′ contains some transitions of T s , the previous reasoning recursively applies on r′′ and its first synchronized transition (by replacing r by r′′, ρ by ρ′′, σ by σ′′) to finally lead to prove that \(\rho _{end} \Supset \sigma _{end}\) with \(\rho _{end} = \ell _{\Theta \ltimes {\Omega }}(r_{end})\) and σ end = Ω(K Ω(r end )) with r end a sequence without any synchronized transition left. This is exactly the previous case a): \(\rho _{end} \Supset \sigma _{end}\) so finally \(\rho ^{\prime \prime } \Supset \sigma ^{\prime \prime }\).

  2. 2.

    Let us prove that \(\mathcal {L}({\Theta } \ltimes {\Omega }) \supseteq \{ \rho \in \mathcal {L}({\Theta }) : \exists \sigma \in \mathcal {L}({\Omega }): \rho \Supset \sigma \}\) . ρ belongs to \(\mathcal {L}({\Theta })\) so there exists a sequence of transitions r from Θ such that M Θ0→[r]M r Θ(r) = ρ. σ belongs to \(\mathcal {L}({\Omega })\) so σε and there exists a sequence of transitions r from Ω such that \(M_{\Omega 0} \to [r^{\prime }] M_{r^{\prime }} : \ell _{\Omega }(r^{\prime }) = \sigma \) and \(M_{r^{\prime }}\) is a final marking of Ω. As \(\rho \Supset \sigma \), there exists σ 0 ∈ Σ such that σ = σ 0 σ and ρ can be written as ρ = ρ 0 σ 0 ρ 1, σ 0ρ 0 and \(\rho _{1} \Supset \sigma ^{\prime }\). It implies firstly that r can be written as M Θ0→[r 0]M r0→[t 1]M t1→[r 1]M r with Θ(t 1) = σ 0 and secondly that r can be written as \(M_{\Omega 0} \to [t_{2}] M_{t2} \to [r^{\prime }_{1}] M_{r^{\prime }}\) with Ω(t 2) = σ 0. σ 0 not being a label of a transition in r 0, (M Θ0M Ω0)→[r 0](M r0M Ω0) is a sequence of transitions of the reachable marking graph of \({\Theta } \ltimes {\Omega }\). By Definition 10, the transition t 1 is in \({\Theta } \ltimes {\Omega }\) and there exists a transition t 1t 2. Both transitions are firable in the marking (M r0M Ω0) but t 1t 2t 1 so only t 1t 2 can be fired: the reachable marking graph of \({\Theta } \ltimes {\Omega }\) thus contains a sequence \((M_{\Theta 0} \cup M_{\Omega 0} ) \to [r_{0}.t_{1}\|t_{2}] (M_{t_{1}} \cup M_{t_{2}})\) and \(\rho _{0}\sigma _{0} = \ell _{\Theta \ltimes {\Omega }}(r_{0}.t_{1}\|t_{2})\) . Suppose now that σ = σ 0σ k ∈ Σ, as \(\rho _{1} \Supset \sigma ^{\prime }\) , we can reapply k times the previous reasoning starting from \(M_{t_{1}}\) in Θ and from \(M_{t_{2}}\) in Ω and then show the existence of reachable markings \(M_{\sigma _{1}},{\dots } M_{\sigma _{k}}\) so that we prove there exists a sequence of transitions \((M_{\Theta 0} \cup M_{\Omega 0} ) \to [s] M_{\sigma _{k}} = (M_{\sigma _{k}}^{\Theta } \cup M_{\sigma _{k}}^{\Omega })\) such that \(\ell _{\Theta \ltimes {\Omega }}(s) = \rho _{k}\sigma _{k}\) in \({\Theta } \ltimes {\Omega }\), \(M_{\sigma _{k}}^{\Theta }\) being a marking of Θ and \(M_{\sigma _{k}}^{\Omega }\) being a marking of Ω. As \(\rho \in \mathcal {L}({\Theta })\), there must finally exist a firable sequence \(M_{\sigma _{k}}^{\Theta } \to [s^{\prime }] M_{r}\) in Θ such that Θ(s.s ) = Θ(r) = ρ. On the other side, as \(\sigma \in \mathcal {L}({\Omega })\), it follows that \((M_{\sigma _{k}}^{\Theta } \cup M_{\sigma _{k}}^{\Omega }) \to [s^{\prime }] (M_{r}\cup M_{\sigma _{k}}^{\Omega })\) belongs to the reachable marking graph of \({\Theta } \ltimes {\Omega }\). Therefore, there exists a firable sequence of transitions \( (M_{\Theta 0} \cup M_{\Omega 0}) \to [s^{\prime \prime }] (M_{r}\cup M_{r^{\prime }})\) in \({\Theta } \ltimes {\Omega }\) such that \(\ell _{\Theta \ltimes {\Omega }}(s^{\prime \prime }) = \rho \) . Finally as M r is a final marking of Θ and \(M_{r^{\prime }}\) is a final marking of Ω, \((M_{r}\cup M_{r^{\prime }})\) is a final marking of \({\Theta } \ltimes {\Omega }\), hence the result: \(\rho \in \mathcal {L}({\Theta } \ltimes {\Omega })\).

1.3 A.3 Proof of Corollary 1

Corollary 1

Let Θ be the LLPPN of a system over an alphabet Σ and Ω be the LLPPN of a pattern:

$$\mathcal{L}({\Theta} \ltimes \overline{\Omega}) = \{ \rho \in \mathcal{L}({\Theta}) : \forall \sigma \in \mathcal{L}({\Omega}): \rho \not \Supset \sigma \}. $$

Proof

Let \(\rho \in \mathcal {L}({\Theta })\), so there exists in Θ a transition sequence \(M_{\Theta 0} \overset {t_{1}}{\longrightarrow } {\dots } \overset {t_{n}}{\longrightarrow } M\) such that Θ(t 1t n ) = ρ. Then, by Definition 10, there exists in \({\Theta } \ltimes {\Omega }\) a transition sequence \(M_{\Theta {\Omega }0} \overset {t^{\prime }_{1}}{\longrightarrow } {\dots } \overset {t^{\prime }_{m}}{\longrightarrow } M^{\prime }\) such that \(\ell _{\Theta \ltimes {\Omega }}(t^{\prime }_{1}{\dots } t^{\prime }_{m}) = \rho \) . Let \(M^{\prime }_{1} \cup M^{\prime }_{2} = M^{\prime }\) with \(M^{\prime }_{1}\) in R(Θ, M Θ0) and \(M^{\prime }_{2}\) in R(Ω, M Ω0) (Lemma 1), if \(M^{\prime }_{2} \in Q_{\Omega }\) then \(\rho \in \mathcal {L}({\Theta } \ltimes {\Omega })\) , otherwise \(M^{\prime }_{2} \in \overline {Q_{\Omega }}\) and \(\rho \in \mathcal {L}({\Theta } \ltimes \overline {\Omega })\). From this it follows that \(\mathcal {L}({\Theta }) = \mathcal {L}({\Theta } \ltimes {\Omega }) \cup \mathcal {L}({\Theta } \ltimes \overline {\Omega })\). The result then follows from Theorem 1. □

1.4 A.4 Proof of Theorem 2

Theorem 2

\(\mathcal {L}(N_{1}\|N_{2}) = \{\rho \in {({\Sigma }_{1} \cup {\Sigma }_{2})}: \mathcal {P}_{{\Sigma }_{1} \cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho ) \in \mathcal {L}(N_{1}) \land \mathcal {P}_{{\Sigma }_{1} \cup {\Sigma }_{2}\to {\Sigma }_{2}}(\rho ) \in \mathcal {L}(N_{2})\}\).

Proof

First, let us prove that \(\mathcal {L}(N_{1}\|N_{2}) \subseteq \{ \rho \in {({\Sigma }_{1} \cup {\Sigma }_{2})}: \mathcal {P}_{{\Sigma }_{1} \cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho ) \in \mathcal {L}(N_{1}) \land \mathcal {P}_{{\Sigma }_{1} \cup {\Sigma }_{2}\to {\Sigma }_{2}}(\rho ) \in \mathcal {L}(N_{2})\}\). Let \(\rho \in \mathcal {L}(N_{1} \| N_{2})\), so there exists in N 1N 2 a transition sequence \(M_{0} \overset {r}{\longrightarrow } M\) with MQ and (r) = ρ. Recalling the definition of masks \(K_{N_{1}}\) and \(K_{N_{2}}\) (see the proof of Lemma 1).

$$K_{N_{1}}(t) = \left\{\begin{array}{lllll} t & \text{if } t \in T_{N_{1}}\\ \varepsilon & \text{if } t \in T_{N_{2}}\\ t_{1} & \text{if } t = t_{1}\|t_{2} \end{array}\right. K_{N_{2}}(t) = \left\{\begin{array}{lllll} t & \text{if } t \in T_{N_{2}}\\ \varepsilon & \text{if } t \in T_{N_{1}}\\ t_{2} & \text{if } t = t_{1}\|t_{2} \end{array}\right., $$

by construction of N 1N 2, the transition sequence r can be associated to a transition sequence \(r_{1}: M_{01} \overset {r_{1}}{\longrightarrow } M_{1}\) of N 1 and a transition sequence \(r_{2}: M_{02} \overset {r_{2}}{\longrightarrow } N_{2}\) of N 2 such that \(r_{1} = K_{N_{1}}(r)\) and \(r_{2} = K_{N_{2}}(r)\). Moreover, as M belongs to Q, M 1Q 1 and M 2Q 2, therefore \(\ell _{1}(r_{1}) \in \mathcal {L}(N_{1})\) and \(\ell _{2}(r_{2}) \in \mathcal {L}(N_{2})\). Now, remark that \(\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho ) = \ell _{1}(r_{1})\) as any transition of N 1N 2 labeled with a label of Σ1 comes from N 1, therefore \(\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho ) \in \mathcal {L}(N_{1})\) . Similarly \(\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{2}}(\rho ) \in \mathcal {L}(N_{2})\).

Now we prove \(\mathcal {L}(N_{1}\|N_{2}) \supseteq \{ \rho \in {({\Sigma }_{1} \cup {\Sigma }_{2})}: \mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho ) \in \mathcal {L}(N_{1}) \land \mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{2}}(\rho ) \in \mathcal {L}(N_{2})\}\). Let ρ defined as above, suppose that ρ contains a set of n, n ≥ 0 events from Σ1 ∩ Σ2 then ρ can be written as ρ = ρ 0 σ 1 ρ 1σ n ρ n with ∀i ∈ {1,…, n}, σ i ∈ Σ1 ∩ Σ2 and ∀i ∈ {0,…, n}, ρ i ∈ ((Σ1∪Σ2)∖(Σ1 ∩ Σ2)). As \(\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho ) \in \mathcal {L}(N_{1})\), \(\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho _{0})\sigma _{1}\dots \sigma _{n}\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho _{n}) \in \mathcal {L}(N_{1})\). Then there must exist in N 1 a sequence of transitions \(M_{01} \overset {r_{1}}{\longrightarrow } M^{1}_{n+1} = M_{01} \overset {{r^{1}_{0}}}{\longrightarrow } {M^{1}_{1}} \overset {{t^{1}_{1}}}{\longrightarrow } M^{1'}_{1}{\dots } \overset {r^{1}_{n-1}}{\longrightarrow } {M^{1}_{n}} \overset {{t^{1}_{n}}}{\longrightarrow } M^{1'}_{n} \overset {{r^{1}_{n}}}{\longrightarrow } M^{1}_{n+1}\) with \({r^{1}_{j}} \in T_{1}^{\ast }, j\in \{ 0,\dots ,n\}, \ell _{1}({t^{1}_{i}}) = \sigma _{i}, i\in \{ 1,\dots ,n\}\) and \(M^{1}_{n+1} \in Q_{1}\) such that \(\ell _{1}(r_{1}) =\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{1}}(\rho )\). Similarly, there must exist in N 2 a sequence of transitions \(M_{02} \overset {r_{2}}{\longrightarrow } M^{2}_{n+1} = M_{02} \overset {{r^{2}_{0}}}{\longrightarrow } {M^{2}_{1}} \overset {{t^{2}_{1}}}{\longrightarrow } M^{2'}_{1}{\dots } \overset {r^{2}_{n-1}}{\longrightarrow } {M^{2}_{n}} \overset {{t^{2}_{n}}}{\longrightarrow } M^{2'}_{n} \overset {{r^{2}_{n}}}{\longrightarrow } M^{2}_{n+1}\) with \({r^{2}_{j}} \in T_{2}^{\ast }, j\in \{ 0,\dots ,n\}, \ell _{2}({t^{2}_{i}}) = \sigma _{i}, i\in \{ 0,\dots ,n\}\) and \(M^{2}_{n+1} \in Q_{2}\) such that \(\ell _{2}(r_{2}) =\mathcal {P}_{{\Sigma }_{1}\cup {\Sigma }_{2}\to {\Sigma }_{2}}(\rho )\). Now, let us prove by induction that for any k from 0 to n, \(M^{1}_{k+1} \cup M^{2}_{k+1}\) is a reachable marking of N 1||N 2.

  • Case k = 0. By construction M 01M 02 is a reachable marking of N 1||N 2. \(M_{01} \overset {{r^{1}_{0}}}{\longrightarrow } {M^{1}_{1}}\) and \(M_{02} \overset {{r^{2}_{0}}}{\longrightarrow } {M^{2}_{1}}\) do not share any common label and might even be empty (i.e. \({r^{1}_{0}}=\varepsilon \) and \({M^{1}_{1}} = M_{01}\) or \({r^{2}_{0}}=\varepsilon \) and \({M^{2}_{1}} = M_{02}\) ). If both are empty then \(M_{01} \cup M_{02} = {M^{1}_{1}}\cup {M^{2}_{1}}\) so \({M^{1}_{1}}\cup {M^{2}_{1}}\) is reachable. If now at least one of the run is not empty, by construction of N 1||N 2 any sequence of transitions s of N 1||N 2 such that \(K_{N_{1}}(s) = M_{01} \overset {{r^{1}_{0}}}{\longrightarrow } {M^{1}_{1}}\) and \(K_{N_{2}}(s) = M_{02} \overset {{r^{2}_{0}}}{\longrightarrow } {M^{2}_{1}}\) is actually a run of N 1||N 2 from M 01M 02, \({M^{1}_{1}} \cup {M^{2}_{1}}\) is thus reachable.

  • General case. Assume \({M^{1}_{k}} \cup {M^{2}_{k}}\) is a reachable marking of N 1||N 2 and consider the part of the runs \({M^{i}_{k}} \overset {{t^{i}_{k}}}{\longrightarrow } M^{i^{\prime }}_{k} \overset {{r^{i}_{k}}}{\longrightarrow } M^{i}_{k+1}, i\in \{1,2\}\) . \({t^{i}_{k}}\) is firable from \({M^{i}_{k}}\) in N i for i ∈ {1,2}. By construction of N 1||N 2, there must exist a transition \({t^{1}_{k}}||{t^{2}_{k}}\) such that \(\ell ({t^{1}_{k}}||{t^{2}_{k}}) = \sigma _{k}\) firable from \({M^{1}_{k}} \cup {M^{2}_{k}}\) and that leads to the marking \(M^{1'}_{k} \cup M^{2'}_{k}\) that is thus reachable. Considering now the run parts \(M^{i^{\prime }}_{k} \overset {{r^{i}_{k}}}{\longrightarrow } M^{i}_{k+1}, i\in \{1,2\}\) , as \(M^{1'}_{k} \cup M^{2'}_{k}\) is reachable, this is similar reasoning as in the case k = 0: it follows that \(M^{1}_{k+1} \cup M^{2}_{k+1}\) is also reachable in N 1||N 2.

Consequently, \(M^{1}_{n+1} \cup M^{2}_{n+1}\) is a reachable marking of N 1||N 2. Finally, remark that \(M^{1}_{n+1}\in Q_{1}\) and \(M^{2}_{n+1}\in Q_{2}\) so \(M^{1}_{n+1} \cup M^{2}_{n+1}\in Q\), therefore \(\rho \in \mathcal {L}(N_{1}||N_{2})\). □

1.5 A.5 Proof of Theorem 3

Theorem 3

\(\mathcal {L}({\Gamma }) = \{ \rho \in {\Sigma }_{\Gamma }^{\ast }, \exists \rho _{1}, \rho _{2} \in \mathcal {L}({\Theta }), \rho _{1} \Supset {\Omega } \land \rho _{2} \not \Supset {\Omega }, \mathcal {P}_{\Sigma \to {\Sigma }_{o}}(\rho _{1}) = \mathcal {P}_{\Sigma \to {\Sigma }_{o}}(\rho _{2}) \land \rho _{1}= \mathcal {P}_{{\Sigma }_{\Gamma }\to {\Sigma }}(\rho ) \land \rho _{2}= \mathcal {R}_{{\Sigma }^{\prime }\to {\Sigma }}(\mathcal {P}_{{{\Sigma }_{\Gamma }}\to {{\Sigma }^{\prime }}}({\rho }))\}\).

Proof

The synchronized product Γ ensures by Theorem 2 that \(\mathcal {L}({\Gamma }) = \{ \rho \in {\Sigma }_{\Gamma }^{\ast },\mathcal {P}_{{\Sigma }_{\Gamma }\to {\Sigma }}(\rho ) \in \mathcal {L}({\Theta } \mathbin {\ltimes } {\Omega })\land \mathcal {P}_{{\Sigma }_{\Gamma }\to {\Sigma }^{\prime }}(\rho ) \in \mathcal {L}({\Theta }^{\prime } \mathbin {\ltimes } \overline {\Omega }^{\prime }) \}\). Theorem 1 states that \(\mathcal {P}_{{\Sigma }_{\Gamma }\to {\Sigma }}(\rho ) \Supset {\Omega }\) and Corollary 1 states that \(\mathcal {R}_{{\Sigma }^{\prime }\to {\Sigma }}(\mathcal {P}_{{\Sigma }_{\Gamma }\to {\Sigma }^{\prime }}(\rho )) \not \Supset {\Omega }\). Finally, as Σ ∩ Σ = Σ o , we get \(\mathcal {P}_{\Sigma \to {\Sigma }_{o}}(\mathcal {P}_{{{\Sigma }_{\Gamma }}\to {\Sigma }}({\rho })) = \mathcal {P}_{{\Sigma }^{\prime }\to {\Sigma }_{o}}(\mathcal {P}_{{{\Sigma }_{\Gamma }}\to {{\Sigma }^{\prime }}}({\rho })) = \mathcal {P}_{{\Sigma }_{\Gamma }\to {\Sigma }_{o}}(\rho )\). □

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gougam, HE., Pencolé, Y. & Subias, A. Diagnosability analysis of patterns on bounded labeled prioritized Petri nets. Discrete Event Dyn Syst 27, 143–180 (2017). https://doi.org/10.1007/s10626-016-0234-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-016-0234-5

Keywords

Navigation