253 search results - page 6 / 51 » Formal analysis of timed continuous Petri nets |
89
Voted
AUTOMATICA
2004
14 years 11 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
116
click to vote
SDL
2003
15 years 1 months ago
2003
A tool for verification of distributed systems defined using standard SDL-96 is described. The SDL description is automatically translated into a high-level Petri net model which...
OPODIS
2008
15 years 1 months ago
2008
Abstract. In this paper we use colored Petri nets (CPNs) and the supporting CPN Tools for the modeling and performance analysis of grid architectures. The notation of Petri nets is...
103
click to vote
APN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
113
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
—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...