Sciweavers

1019 search results - page 57 / 204
» Petri Net Transformations in the
Sort
View
WSC
1997
13 years 9 months ago
Petri Net Based Simulation of Construction Schedules
Scheduling of a construction project requires: a) hierarchical decomposition of the project; b) incorporation of risk and uncertainty in the activity time and cost estimates; and ...
Anil Sawhney
ENTCS
2002
103views more  ENTCS 2002»
13 years 7 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
FSTTCS
2009
Springer
14 years 2 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
BPM
2003
Springer
116views Business» more  BPM 2003»
14 years 29 days ago
Use Cases as Workflows
Abstract. In requirements engineering we have to discover the user requirements and then we have to transform them into precise system specifications. There are two essential aspec...
Michel R. V. Chaudron, Kees M. van Hee, Lou J. Som...
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann