8 citations · 15 across the 4 of their papers we have counts for
4 papers
Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes
Petr Jančar, Jiří Srba
Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by epsilon-free second-order pushdown automata. We add a few remark…
Time-Darts: A Data Structure for Verification of Closed Timed Automata
Kenneth Y. Jørgensen, Kim G. Larsen, Jiří Srba
Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structur…
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Alexandre David, Lasse Jacobsen, Morten Jacobsen +1
Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We pres…
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Morten Kühnrich, Stefan Schwoon, Jiří Srba +1
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…