Sciweavers

957 search results - page 57 / 192
» Negotiations and Petri Nets
Sort
View
CONCUR
2000
Springer
15 years 3 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
ATAL
2008
Springer
15 years 1 months ago
Theoretical and experimental results on the goal-plan tree problem
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
Patricia H. Shaw, Berndt Farwer, Rafael H. Bordini
BPM
2006
Springer
160views Business» more  BPM 2006»
15 years 1 months ago
Analyzing Interacting BPEL Processes
Abstract. This paper addresses the problem of analyzing the interaction between BPEL processes. We present a technology chain that starts out with a BPEL process and transforms it ...
Niels Lohmann, Peter Massuthe, Christian Stahl, Da...
BPM
2008
Springer
142views Business» more  BPM 2008»
15 years 1 months ago
Towards Process Models for Disaster Response
In the immediate aftermath of a disaster routine processes, even if specifically designed for such a situation, are not enacted blindly. Actions and processes rather adapt their be...
Dirk Fahland, Heiko Woith
IAJIT
2008
118views more  IAJIT 2008»
14 years 11 months ago
Integration of the Association Ends within UML State Diagrams
: UML currently still lacks a rigorously defined semantics for its models, which makes formally analyzing a model and verifying its properties extremely difficult. To remedy that, ...
Thouraya Bouabana-Tebibel, Mounira Belmesk