CoPModL: Construction Process Modeling Language and Satisfiability Checking

被引:2
|
作者
Marengo, Elisa [1 ]
Nutt, Werner [1 ]
Perktold, Matthias [1 ]
机构
[1] Free Univ Bozen Bolzano, Fac Comp Sci, Bolzano, Italy
关键词
Multi-instance process modeling; Satisfiability checking of a process model; Construction processes; BUSINESS PROCESSES; BPMN; PARADIGM;
D O I
10.1016/j.is.2019.101457
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Process modeling has been widely investigated in the literature and several general purpose approaches have been introduced, addressing a variety of domains. However, generality goes to the detriment of the possibility to model details and peculiarities of a particular application domain. As acknowledged by the literature, known approaches predominantly focus on one aspect between control flow and data, thus neglecting the interplay between the two. Moreover, process instances are not considered or considered in isolation, neglecting, among other aspects, synchronization points among them. As a consequence, the model is an approximation of the real process, limiting its reliability and usefulness in particular domains. This observation emerged clearly in the context of a research project in the construction domain, where preliminary attempts to model inter-company processes show the lack of an appropriate language. Building on a semi-formal language tested on real construction projects, in this paper we define CoPModL, a process modeling language which accounts both for activities and items on which activities are to be executed. The language supports the specification of different item-based dependencies among the activities, thus serving as a synchronization specification among several activity instances. We provide a formal semantics for the language in terms of LTL over finite traces. This paves the way for the development of automatic reasoning. In this respect, we investigate process model satisfiability and develop an effective algorithm to check it. (c) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:23
相关论文
共 50 条
  • [31] Satisfiability Checking for Mission-Time LTL
    Li, Jianwen
    Vardi, Moshe Y.
    Rozier, Kristin Y.
    COMPUTER AIDED VERIFICATION, CAV 2019, PT II, 2019, 11562 : 3 - 22
  • [32] Industrial model checking based on satisfiability solvers
    Bjesse, P
    MODEL CHECKING SOFTWARE, PROCEEDINGS, 2002, 2318 : 240 - 240
  • [33] Accelerating LTL satisfiability checking by SAT solvers
    Li, Jianwen
    Pu, Geguang
    Zhang, Lijun
    Vardi, Moshe Y.
    He, Jifeng
    JOURNAL OF LOGIC AND COMPUTATION, 2018, 28 (06) : 1011 - 1030
  • [34] Some progress in satisfiability checking for difference logic
    Cotton, S
    Asarin, E
    Maler, O
    Niebert, P
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 263 - 276
  • [35] Bounded model checking using satisfiability solving
    Clarke, E
    Biere, A
    Raimi, R
    Zhu, Y
    FORMAL METHODS IN SYSTEM DESIGN, 2001, 19 (01) : 7 - 34
  • [36] Proof Checking Technology for Satisfiability Modulo Theories
    Stump, Aaron
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 228 : 121 - 133
  • [37] Constraint LTL satisfiability checking without automata
    Bersani, Marcello M.
    Frigeri, Achille
    Morzenti, Angelo
    Pradella, Matteo
    Rossi, Matteo
    San Pietro, Pierluigi
    JOURNAL OF APPLIED LOGIC, 2014, 12 (04) : 522 - 557
  • [38] Modeling and Optimizing the Process of Airport Security Checking
    Li, Jia-lin
    Zhang, Shuang
    Yan, Qi-xiang
    Cai, Zhi-dan
    2017 2ND INTERNATIONAL CONFERENCE ON COMPUTATIONAL MODELING, SIMULATION AND APPLIED MATHEMATICS (CMSAM), 2017, : 108 - 116
  • [39] EAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties
    Finkbeiner, Bernd
    Hahn, Christopher
    Stenger, Marvin
    COMPUTER AIDED VERIFICATION (CAV 2017), PT II, 2017, 10427 : 564 - 570
  • [40] Model checking and satisfiability for sabotage modal logic
    Löding, C
    Rohde, P
    FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 302 - 313