Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Schwoon, Stefan"'
Publikováno v:
Bulletin of the European Association for Theoretical Computer Science 72: 169-177 (2000)
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. This approach is of pedagogical interest since it provides a uniform so
Externí odkaz:
http://arxiv.org/abs/2410.19386
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 parts of the reachability space from which there is no return to othe
Externí odkaz:
http://arxiv.org/abs/2409.01079
Publikováno v:
EPTCS 370, 2022, pp. 178-193
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 parts of the reachability space from which there is no return to othe
Externí odkaz:
http://arxiv.org/abs/2209.10323
Autor:
Schwoon, Stefan
Formal methods provide means for rigorously specifying the desired behaviour of a hardware or software system, making a precise model of its actual behaviour, and then verifying whether that actual behaviour corresponds to the specification. My habil
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00927066
http://tel.archives-ouvertes.fr/docs/00/92/70/66/PDF/hdr-schwoon13.pdf
http://tel.archives-ouvertes.fr/docs/00/92/70/66/PDF/hdr-schwoon13.pdf
We study the following summarization problem: given a parallel composition A=A1||...||An of labelled transition systems communicating with the environment through a distinguished component Ai, efficiently compute a summary Si such that E||A and E||Si
Externí odkaz:
http://arxiv.org/abs/1310.2143
Publikováno v:
EPTCS 54, 2011, pp. 31-44
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 causal precedence, concurrency, and conflict between events. Here, we explo
Externí odkaz:
http://arxiv.org/abs/1106.1230
Autor:
Gaiser, Andreas, Schwoon, Stefan
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 be done in linear time, and a variety of algorithms with this property
Externí odkaz:
http://arxiv.org/abs/0910.3766
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes after a finite number of steps. Previously known approaches considered only
Externí odkaz:
http://arxiv.org/abs/0901.0501
Publikováno v:
In IFAC PapersOnLine 2018 51(7):106-111
