Horst Müller Inductive Assertions for Analyzing Reachability Sets. [Citation Graph (0, 0)][DBLP] Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981, pp:168-171 [Conf]
Horst Müller Correctness Proof for the Alternating Bit Protocol by Assertion Systems. [Citation Graph (0, 0)][DBLP] Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981, pp:323-326 [Conf]
Horst Müller The reachability problem for VAS. [Citation Graph (0, 0)][DBLP] European Workshop on Applications and Theory in Petri Nets, 1984, pp:376-391 [Conf]
Horst Müller Endliche Automaten und Labyrinthe. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1971, v:7, n:4, pp:261-264 [Journal]
Horst Müller Automata Catching Labyrinths with at most Three Components. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1979, v:15, n:1/2, pp:3-9 [Journal]
Horst Müller Weak Petri Net Computers for Ackermann Functions. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1985, v:21, n:4/5, pp:236-246 [Journal]
Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP