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 条
  • [21] Symbolic Computation Techniques in Satisfiability Checking
    Abraham, Erika
    PROCEEDINGS OF 2016 18TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC), 2016, : 3 - 10
  • [22] Using Symmetries to Lift Satisfiability Checking
    Carbonnelle, Pierre
    Schenner, Gottfried
    Bruynooghe, Maurice
    Bogaerts, Bart
    Denecker, Marc
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 7961 - 7968
  • [23] Optimal Satisfiability Checking for Arithmetic μ-Calculi
    Hausmann, Daniel
    Schroeder, Lutz
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2019, 2019, 11425 : 277 - 294
  • [24] A SIMPLE TEST IMPROVES CHECKING SATISFIABILITY
    LOZINSKII, EL
    JOURNAL OF LOGIC PROGRAMMING, 1993, 15 (1-2): : 99 - 111
  • [25] ONTOLOGICAL APPROACH FOR THE CONFORMITY CHECKING MODELING IN CONSTRUCTION
    Faron-Zucker, Catherine
    Le Thanh, Nhan
    Yurchyshyna, Anastasiya
    Zarli, Alain
    ICEIS 2008: PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS, VOL AIDSS: ARTIFICIAL INTELLIGENCE AND DECISION SUPPORT SYSTEMS, 2008, : 492 - +
  • [26] PROCESS INTERFACE MODELING AND CONSISTENCY CHECKING
    KUNG, CH
    JOURNAL OF SYSTEMS AND SOFTWARE, 1991, 15 (02) : 185 - 191
  • [27] Use and construction of tools for checking large language definitions
    Pronk, C.
    Plat, N.
    Biegstraaten, A.W.W.M.
    High integrity systems, 1996, 1 (06): : 557 - 567
  • [28] Boolean Satisfiability Solvers and Their Applications in Model Checking
    Vizel, Yakir
    Weissenbacher, Georg
    Malik, Sharad
    PROCEEDINGS OF THE IEEE, 2015, 103 (11) : 2021 - 2035
  • [29] Satisfiability checking using Boolean Expression Diagrams
    Poul F. Williams
    Henrik R. Andersen
    Henrik Hulgaard
    International Journal on Software Tools for Technology Transfer, 2003, 5 (1) : 4 - 14
  • [30] Variable and Clause Elimination for LTL Satisfiability Checking
    Suda, Martin
    MATHEMATICS IN COMPUTER SCIENCE, 2015, 9 (03) : 327 - 344