- CSB - MetaPress - Google - Bing - Yahoo
 | 1985 | |
|---|---|---|
| 9 |      | Horst Müller: Weak Petri Net Computers for Ackermann Functions. Elektronische Informationsverarbeitung und Kybernetik 21(4/5): 236-246 (1985) |
| 1984 | ||
| 8 |  | Horst Müller: The reachability problem for VAS. European Workshop on Applications and Theory in Petri Nets 1984: 376-391 |
| 1981 | ||
| 7 | | Gerhard Fritsch, Horst Müller: Parallelization of a minimization problem for multiprocessor systems. CONPAR 1981: 453-463 |
| 6 | | Horst Müller: Inductive Assertions for Analyzing Reachability Sets. Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets 1981: 168-171 |
| 5 | | Horst Müller: Correctness Proof for the Alternating Bit Protocol by Assertion Systems. Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets 1981: 323-326 |
| 4 | | Horst Müller: Reachability Analysis with Assertion Systems. Theoretical Computer Science 1981: 214-223 |
| 1980 | ||
| 3 | | Horst Müller: Decidability of Reachability in Persistent Vector Replacement Systems. MFCS 1980: 426-438 |
| 1979 | ||
| 2 | | Horst Müller: Automata Catching Labyrinths with at most Three Components. Elektronische Informationsverarbeitung und Kybernetik 15(1/2): 3-9 (1979) |
| 1971 | ||
| 1 | | Horst Müller: Endliche Automaten und Labyrinthe. Elektronische Informationsverarbeitung und Kybernetik 7(4): 261-264 (1971) |
| 1 | Gerhard Fritsch | [7] |