Skip to main content
Top

2021 | OriginalPaper | Chapter

3. Calculating the Number of Distinct Paths in a Block-Structured Model

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

When formalising the quality dimensions in the previous chapter, we already slightly touched upon the difficulties that exist in quantifying process behaviour.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
While the algorithm introduced in this chapter is used in the experiments of subsequent chapters, non-technical readers can skip this chapter without any harm to the continuity.
 
2
This is so for the process tree notation. One could argue whether the third element is in fact part of the loop when considering other notations, but the point remains that it is always possible to transform a structured finite loop to a three-block construct.
 
3
Note that when only a single of the children is executed—i.e. S only contains one path dictionary—then \(R = Parallel(S) = S\) according to Algorithm 3.3.
 
4
\(\mathbb {P}(\{T_i\})\) refers to the set of all subsets of \(\{T_1, ..., T_u\}\).
 
5
At least one of the branches of a non-exclusive choice should be executed.
 
6
For the sake of completeness, there would be 8 different paths in the tree if we could observe silent transitions and distinguish the duplicate tasks from each other. When we label the leaf nodes in \(PT_4\) as \(a_1, \tau _1, a_2\) and \(\tau _2\), the tree can produce the following sequences: \(\langle a_1 a_2\rangle , \langle a_2 a_1\rangle ,\langle \tau _1 \tau _2\rangle , \langle \tau _2 \tau _1\rangle ,\langle a_1 \tau _2\rangle ,\langle a_2 \tau _1\rangle , \langle \tau _1 a_2\rangle , \langle \tau _2 a_1\rangle \).
 
Metadata
Title
Calculating the Number of Distinct Paths in a Block-Structured Model
Author
Gert Janssenswillen
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-70733-0_3

Premium Partner