No label defined (Q4782023)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1836354
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1836354

      Statements

      0 references
      0 references
      2000
      0 references
      automata networks
      0 references
      Kronecker representation
      0 references
      equivalence
      0 references
      reachability analysis
      0 references
      ordered natural decision diagrams
      0 references
      composed automaton
      0 references
      bisimulation equivalence
      0 references
      Some efficient techniques of reachability analysis of composed automata are considered. An automaton is defined as a 4-tuple \(A=(S,\delta,s_0,L)\) where \(S\), \(L\) are the set of states and the set of labels, \(s_0\) is the initial state and \(\delta \subseteq S \times S \times L\) is a transition relation. A transition \(s_x \to s_y\) carries the label \(l\) if \((s_x,s_y,l) \in \delta\). Given automata \(A_1,A_2,\dots,A_N\), a synchronized automaton \(A_1| A_2| \dots| A_N\) is defined by the requirement that only such transitions \(s_{x_i} \to s_{y_i}\), \(i=1,\dots,N\) are simultaneously allowed which carry the same labels. It is described by means of the Kronecker representation. The cardinality of the state space of the composed automaton is the main challenge in the area of system verification. To reduce the cardinality of the state space, some techniques are considered, e.g. bisimulation equivalence and decision diagrams. An example of the application of the considered techniques is given. For the entire collection see [Zbl 0996.00058].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references