Reliable Execution of Business Processes on Dynamic Networks of Service-Enabled Devices

被引:1
作者
Spiess, P.
Karnouskos, S.
Souza, L.
Savio, D.
Guinard, D.
Trifa, V.
Baecker, O.
Koehler, M.
机构
来源
2009 7TH IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS, VOLS 1 AND 2 | 2009年
关键词
D O I
10.1109/INDIN.2009.5195860
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
It is expected that future shop-floors will be populated by thousands of networked embedded devices. Those will not only communicate using IP (as in TCP/IP), but also feature some autonomy, allowing them to collaborate among themselves and with enterprise systems. As they can offer both their mechatronic and higher-level functions as a service and support dynamic deployment of new code, they can execute business logic locally, allowing for new classes of business processes that are executed collaboratively by back-end and embedded systems. While some parts of a process will still be executed in the data centre, the rest will execute directly on embedded devices on the shop-floor. Business Process execution will therefore be more dynamic and context-based. We introduce an approach to manage efficient business process execution over such highly dynamic infrastructures.
引用
收藏
页码:533 / 538
页数:6
相关论文
共 13 条
  • [1] CHAFLE GB, 2004, WWW ALT 04, P134
  • [2] CHAN S, 2005, DEVICES PROFILE WEB
  • [3] de Souza LMS, 2008, LECT NOTES COMPUT SC, V4952, P50
  • [4] Fleisch E., 2005, INTERNET DINGE UBIQU
  • [5] ALGORITHM-97 - SHORTEST PATH
    FLOYD, RW
    [J]. COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 345 - 345
  • [6] FRIESE T, 2005, P ICAC
  • [7] Hackmann G, 2007, 2007 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE SERVICES, P204
  • [8] Hackmann G, 2006, LECT NOTES COMPUT SC, V4294, P503
  • [9] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS
    JOHNSON, DB
    [J]. JOURNAL OF THE ACM, 1977, 24 (01) : 1 - 13
  • [10] KARNOUSKOS S, 2007, 12 IEEE C EM TECHN F