18 citations · 22 across the 6 of their papers we have counts for
7 papers
A Uniform Framework for Problems on Context-Free Grammars
Javier Esparza, Peter Rossmanith, Stefan Schwoon
In a paper published in Information Processing Letters in 2000, Bouajjani et al. presented an automata-based approach to a number of elementary problems on context-free grammars. T…
Attractor Basins in Concurrent Systems
Giann Karlo Aguirre Samboni, Stefan Haar, Loic Paulevé +2
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into…
Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets
Giann Karlo Aguirre-Samboní, Stefan Haar, Loïc Paulevé +2
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into…
Computation of Summaries Using Net Unfoldings
Javier Esparza, Loïg Jezequel, Stefan Schwoon
We study the following summarization problem: given a parallel composition A=A1||...||An of labelled transition systems communicating with the environment through a distinguished c…
Computing the Reveals Relation in Occurrence Nets
Stefan Haar, Christian Kern, Stefan Schwoon
Petri net unfoldings are a useful tool to tackle state-space explosion in verification and related tasks. Moreover, their structure allows to access directly the relations of causa…
Comparison of Algorithms for Checking Emptiness on Buechi Automata
Andreas Gaiser, Stefan Schwoon
We re-investigate the problem of LTL model-checking for finite-state systems. Typical solutions, like in Spin, work on the fly, reducing the problem to Buechi emptiness. This can b…