Sciweavers

11328 search results - page 73 / 2266
» Timed Branching Processes
Sort
View
APN
2004
Springer
15 years 8 months ago
Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation
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, ...
Olivier H. Roux, Didier Lime
ICALP
2000
Springer
15 years 6 months ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli
JCSS
2000
116views more  JCSS 2000»
15 years 2 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
IS
2011
14 years 10 months ago
Time prediction based on process mining
Abstract. Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This ...
Wil M. P. van der Aalst, M. H. Schonenberg, Minseo...
ICECCS
2007
IEEE
125views Hardware» more  ICECCS 2007»
15 years 7 months ago
Achieving Discrete Relative Timing with Untimed Process Algebra
For many systems, timing aspects are essential. Therefore, when modelling these systems, time should somehow be represented. In the past, many timed process algebras have been dev...
Anton Wijs