5 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.LO2013★ 5 cited
Petri Nets with Time and Cost
Parosh Aziz Abdulla, Richard Mayr
We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on…
cs.FL2012★ 4 cited
Advanced Automata Minimization
Lorenzo Clemente, Richard Mayr
We present an efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-comp…