4 citations · 9 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2014★ 3 cited
Constructing Coverability Graphs for Time Basic Petri Nets
Matteo Camilli
Time-Basic Petri nets, is a powerful formalism for modeling real-time systems where time constraints are expressed through time functions of marking's time description associated w…
cs.LO2014★ 2 cited
Verification of Reachability Problems for Time Basic Petri Nets
Matteo Camilli
Time-Basic Petri nets, is a powerful formalism for model- ing real-time systems where time constraints are expressed through time functions of marking's time description associated…