Horst Müller

13 papers B 1Journal 6Unranked 5
YearRankTypeTitle / Venue / Authors
1993 — —
Komplexes Problemlösen: Reliabilität und Wissen.
Horst Müller
1992 J jnl
Improvements on printing mice in labyrinths.
Computing
Horst Müller
1988 J jnl
Höhere Petri-Netze - ein Werkzeug für Modellierung und Analyse verteilter Systeme und paralleler Datenverarbeitungsprozesse / High level Petri nets, a tool for modelling and analysis of distributed systems.
it Inf. Technol.
Horst Müller
1985 J jnl
Weak Petri Net Computers for Ackermann Functions.
J. Inf. Process. Cybern.
Horst Müller
1984 — conf
The reachability problem for VAS.
European Workshop on Applications and Theory in Petri Nets
Horst Müller
1981 — conf
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
Horst Müller
1981 — conf
Inductive Assertions for Analyzing Reachability Sets.
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
Horst Müller
1981 — conf
Parallelization of a minimization problem for multiprocessor systems.
CONPAR
Gerhard Fritsch, Horst Müller
1981 — conf
Reachability Analysis with Assertion Systems.
Theoretical Computer Science
Horst Müller
1980 B conf
Decidability of Reachability in Persistent Vector Replacement Systems.
MFCS
Horst Müller
1979 J jnl
Automata Catching Labyrinths with at most Three Components.
J. Inf. Process. Cybern.
Horst Müller
1977 J jnl
A one-symbol printing automaton escaping from every labyrinth.
Computing
Horst Müller
1971 J jnl
Endliche Automaten und Labyrinthe.
J. Inf. Process. Cybern.
Horst Müller