11 citations · 33 across the 10 of their papers we have counts for
4 papers · 1 filter
Methods for Efficient Unfolding of Colored Petri Nets
Alexander Bilgram, Peter G. Jensen, Thomas Pedersen +2
Colored Petri nets offer a compact and user friendly representation of the traditional P/T nets and colored nets with finite color ranges can be unfolded into the underlying P/T ne…
Stubborn Set Reduction for Two-Player Reachability Games
Frederik Meyer Bønneland, Peter Gjøl Jensen, Kim Guldstrand Larsen +2
Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of…
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…
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…