Sökning: "Declarative constraints"
Hittade 3 uppsatser innehållade orden Declarative constraints.
1. IMPERATIVE MODELS TO DECLARATIVE CONSTRAINTS : Generating Control-Flow Constraints from Business Process Models
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : In complex information systems, it is often crucial to evaluate whether a sequence of activities obtained from a system log complies with behavioural rules. This process of evaluation is called conformance checking, and the most classical approach to specifying the behavioural rules is in the form of flow chartlike process diagrams, e.g. LÄS MER
2. Linear dynamic logic on finite traces in business process management : a compositional approach
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : One way of modeling workflows in business process management (BPM) is by using a declarative approach, that is, instead of imperatively specifying what needs to be done, and in what order, one can specify constraints on what is allowed. The result is a more flexible model as everything that does not violate the specified constraints is allowed. LÄS MER
3. A SYSTEMATIC MAPPING STUDY ON DEVELOPMENT OF BLOCKCHAIN-BASED SMART CONTRACTS
Master-uppsats, Mälardalens högskola/Akademin för innovation, design och teknikSammanfattning : Context - Blockchain-based smart contracts have drawn the attention of scientific communities and businesses in recent years. The development of blockchain-based smart contracts is different from the development of conventional software due to the blockchain characteristics such as immutability, trustlessness, being append-only, and being decentralized. LÄS MER