1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.FL2014
Lattice structures for bisimilar Probabilistic Automata
Johann Schuster, Markus Siegle
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA.…
cs.LO2013
Some notes on the abstraction operation for Multi-Terminal Binary Decision Diagrams
Ludwig Griebl, Johann Schuster
The starting point of this work are inaccurate statements found in the literature for Multi-terminal Binary Decision Diagrams (MTBDDs) regarding the well-definedness of the MTBDD a…
cs.LO2012★ 1 cited
Markov Automata: Deciding Weak Bisimulation by means of non-naively Vanishing States
Johann Schuster, Markus Siegle
This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For that purpose, different notions of vanishing state (a concept known from the area of Gen…