Sciweavers

3495 search results - page 48 / 699
» On the random satisfiable process
Sort
View
DLOG
2009
13 years 8 months ago
Validating Process Refinement with Ontologies
A crucial task in process management is the validation of process refinements. A process refinement is a process description in a more fine-grained representation. The refinement i...
Yuan Ren, Gerd Gröner, Jens Lemcke, Tirdad Ra...
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 10 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
QSIC
2007
IEEE
14 years 5 months ago
Towards Automatic Measurement of Probabilistic Processes
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in...
Lin Song, Yuxin Deng, Xiaojuan Cai
BPM
2007
Springer
142views Business» more  BPM 2007»
14 years 5 months ago
Next-generation Process Management with ADEPT2
Short time-to-market, easy adaptation to changes in business environment, and robustness of processes are key requirements in today’s business world. In the IT area of Business P...
Kevin Göser, Martin Jurisch, Hilmar Acker, Ul...
EPK
2007
155views Management» more  EPK 2007»
14 years 6 days ago
From Process Models to Business Landscapes
: Today, architecture and business processes are modeled separately. The only integration in architectural diagrams is done with Petri nets in the Fundamental Modeling Concept. Sin...
Oliver Kopp, Hanna Eberle, Tobias Unger, Frank Ley...