1 Erratum to: Nat Comput (2015) 14:535–544 DOI 10.1007/s11047-015-9520-7

The subtitles in Fig. 2 were the wrong way around, and some of the transitions were false.

Figure 2 has been corrected and provided below.

Fig. 2
figure 2

Synchronous and asynchronous transition graphs of the running example. The trap spaces (and the way they are nested) are given as a heat map. Minimal and maximal trap spaces are outlined by a black line and the attractors by a white line. Using the “\( { \star } \)” notation, we get the following sets: \( S_{ \to }^{{ \star }} = \{ { \star \star \star \star },00{ \star \star },1{ \star \star \star },1{ \star }0{ \star },1{ \star }01,1101\} \), \( \hbox{min} (S_{ \to }^{{ \star }} ) = \{ 00{ \star \star },1101\} \) and \( \hbox{max} (S_{ \to }^{{ \star }} ) = \{ 00{ \star \star },1{ \star \star \star }\} \) and \( S_{F} = \{ 1101\} \)

Full size image