Monitoring the manufacturing process

Through the smart contracts on homomorphic encryption and blockchain platforms, the pharmaceutical process is monitored and verified, and the problem of difficult compliance and confidentiality in the pharmaceutical process is solved, and the transparency and trust of the process are achieved, ensuring compliance and Privacy protection.

CN112703520BInactive Publication Date: 2024-11-12COMMONWEALTH SCI & IND RES ORG
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201980060716.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2018-10-31
Filing Date
2019-10-23
Publication Date
2024-11-12
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In the pharmaceutical process, it is difficult for the existing technology to ensure compliance and confidentiality of the drug production process without disclosure of the 'secret law', especially in multi-party supply chains, resulting in current tools due to the lack of trust and transparency. The compliance of the process cannot be effectively ensured.

Method used

Using homomorphic encryption and blockchain platforms, smart contracts are created to represent the monitoring and verification of pharmaceutical processes through encrypted numerical values, ensuring the compliance and confidentiality of the process, preventing unauthorized access, and allowing calculation and execution of the combination Regularity inspection.

Benefits of technology

It achieves the compliance and confidentiality of the drug production process without disclosing the details of the pharmaceutical process, enhances the transparency and trust of the supply chain, and ensures the compliance and privacy of the process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112703520B_ABST
    Figure CN112703520B_ABST
Patent Text Reader

Abstract

The present invention relates to a monitoring process. A processor creates a numerical representation of the nominal operation of the process. The processor then uses homomorphic encryption to encrypt the numerical representation to determine an encrypted numerical representation that blocks access to the numerical representation but allows calculation of the numerical representation. The processor proceeds by creating a smart contract on a blockchain platform using the encrypted numerical representation as a first input to the calculation of the smart contract. Next, the processor attempts to execute the smart contract using the current operation of the process as a second input to the calculation of the smart contract. The execution of the smart contract generates an output result by performing calculations on the encrypted numerical representation. Based on the output of the execution of the smart contract, the processor ultimately determines that the current operation is outside the nominal operation.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Related Applications

[0002] This application claims priority to Australian provisional application 2018904146 filed on October 31, 2018, which is incorporated herein by reference in its entirety. Technical Field

[0003] The present invention relates to monitoring processes and in particular, but not exclusively, to monitoring the current operations of a pharmaceutical factory. Background Art

[0004] Pharmaceutical manufacturing is the process of industrial-scale synthesis of drugs. The drug manufacturing process can be divided into a series of unit operations such as milling, granulation, coating, tableting, etc. Before a drug can be produced on any scale, much work is involved in the actual formulation of the drug. Formulation development scientists evaluate the uniformity, stability and many other factors of the compound. After the evaluation stage, solutions are developed to deliver the desired form of the drug, such as solid, semi-solid, immediate or controlled release, tablets or capsules. A wide range of excipients can be blended together to produce the final blend for making solid dosage forms. The range of materials that can be blended (excipients, API, etc.) presents many variables that are intended to achieve products with acceptable blend uniformity. These variables can include particle size distribution (including aggregates or agglomerates of materials), particle shape (spherical, rod-shaped, cubic, plate-shaped and irregular shapes), the presence of moisture (or other volatile compounds) and particle surface properties (roughness, cohesion). In the pharmaceutical process, grinding is usually required to reduce the average particle size in the drug powder. There are many reasons for this, including increasing uniformity and dosage uniformity, increasing bioavailability and increasing the solubility of drug compounds. Granulation can be described as the opposite of grinding; it is a process of combining small particles together to form larger particles (called granules). Granulation is used for several reasons. Granulation prevents "separation" of components in a mixture by producing granules containing all components in the desired proportions, improves the flow characteristics of powders (because small granules do not flow well), and improves the compaction characteristics of tablet formation. Hot melt extrusion can be used in pharmaceutical solid oral dosage processing to enable the delivery of drugs with poor solubility and bioavailability. Hot melt extrusion can be used to disperse poorly soluble drug molecules in a polymer carrier, improving dissolution rate and bioavailability. The process involves applying heat, pressure and agitation to mix the materials together and 'extrude' them through a die. Twin-screw high shear extruders blend the materials and break up the granules at the same time. The resulting granules can be blended and compressed into tablets or filled into capsules.

[0005] This shows that pharmaceutical manufacturing is complex and involves a large number of parameters that need to be within their correct nominal ranges and steps that need to follow each other in a prescribed nominal order. At the same time, there is a trend towards lean manufacturing and digital manufacturing. However, these new ways of organizing business require technical solutions as enablers. In particular, there are concerns about confidentiality between multiple parties in the supply chain. There is currently a challenge to ensure that the processes of all entities comply with the overall set of rules. However, at the same time, the actual process as well as the nominal process parameters and the nominal step sequence should not be disclosed to third parties. Therefore, there is a need for a computer system that is located underneath the supply chain and / or manufacturing process and is able to verify the compliance of the process without disclosing the "secret recipe".

[0006] The blockchain network provides a trusted environment that does not rely on any centralized trusted third party. The blockchain data structure is a distributed ledger maintained by the nodes of the peer-to-peer network. The public ledger stores all the time-stamped transactions that occur in the system. A distributed consensus protocol is used to agree on which transactions should be included in the public ledger and which transactions should not be included in the public ledger. Each transaction is verified by all network participants before being included in the public ledger.

[0007] In a multi-party process, an organization may delegate parts of a process to external parties. Different parts of the process may be performed by different organizations. Often in this case, trust between the parties involved may be limited. In most cases, proprietary information about the individual business processes should remain private. The execution of activities and the transfer of data are subject to the conditions governing those activities. Each party wants to ensure that the "outsourced" part of the process is performed as agreed and in accordance with the applicable conditions. Current process execution tools are unable to ensure compliance along such a service chain due to the lack of trust and transparency in the mutual processes.

[0008] Any discussion of documents, acts, materials, devices, articles or the like that has been included in this specification should not be taken as an admission that any or all of these matters form part of the prior art base or were common general knowledge in the field relevant to the present invention as it existed before the priority date of each claim of this application.

[0009] Throughout the specification, the word "comprise" or variations such as "comprises" or "comprising" will be understood to mean the inclusion of stated elements, integers or steps, or groups of elements, integers or steps, but not the exclusion of any other elements, integers or steps, or groups of elements, integers or steps. Summary of the invention

[0010] A method for manufacturing a pharmaceutical compound by monitoring the current operation of a pharmaceutical factory is provided. The method comprises:

[0011] Create a numerical representation of the nominal operations of a pharmaceutical plant;

[0012] encrypting the numerical representation using homomorphic encryption to determine an encrypted numerical representation that prevents access to the numerical representation but allows computation on the numerical representation;

[0013] creating a smart contract on a blockchain platform using the encrypted numerical representation as a first input to a computation of the smart contract;

[0014] attempting to execute the smart contract using the current operation of the pharmaceutical factory as a second input to the computation of the smart contract, the execution of the smart contract producing an output result by performing computation on the encrypted numerical representation;

[0015] Based on the output of the execution of the smart contract, it is determined that the current operation is outside the nominal operation.

[0016] Methods for monitoring the current operation of a process include:

[0017] Create a numerical representation of the nominal operation of the process;

[0018] encrypting the numerical representation using homomorphic encryption to determine an encrypted numerical representation that prevents access to the numerical representation but allows computation on the numerical representation;

[0019] creating a smart contract on a blockchain platform using the encrypted numerical representation as a first input to a computation of the smart contract;

[0020] Attempting to execute the smart contract using the current operation of the process as a second input to a computation of the smart contract, the execution of the smart contract generating an output result by performing a computation on the encrypted numerical representation;

[0021] Based on the output of the execution of the smart contract, it is determined that the current operation is outside the nominal operation.

[0022] Determining that the current operation is outside of the nominal operation may be in response to determining a failure to execute the smart contract.

[0023] The method may further include preventing current operation of the process upon determining that the current operation is outside of nominal operation.

[0024] The method may further include, upon determining that the current operation is outside of nominal operation, allowing further execution of the process and generating a report indicating that the current operation is outside of the nominal operation.

[0025] Creating the numerical representation of the nominal operation may include creating a petri net of the nominal operation and creating the numerical representation of the petri net.

[0026] The numerical representation may indicate the positions of the nominal operations and the valid conversions between those positions, and may include a plurality of binary nominal vectors, and each of the plurality of binary nominal vectors may represent one of the valid conversions between the positions.

[0027] The plurality of binary nominal vectors may include, for each transformation, a binary pre-vector indicating one or more positions at which the transformation is enabled and a binary post-vector indicating one or more possible positions after the transformation.

[0028] Creating the numerical representation may include determining the plurality of tracks by the position and the translation and determining a pre-vector and a post-vector such that the pre-vector and the post-vector represent the plurality of tracks.

[0029] The current operation of the process can be represented by a binary current state vector, and the smart contract includes binary operations based on the current state vector and the encrypted nominal vector.

[0030] The computation of a smart contract may include binary operations based on a previous state vector indicating a previous state of the operation.

[0031] The computation of a smart contract may include binary operations between an encrypted previous state vector and an encrypted current state vector.

[0032] The computation of the smart contract may include binary operations based on the use of the encrypted post vector and selection of transformations based on the encrypted post vector.

[0033] The calculation of the smart contract may include a binary AND operation between the encrypted previous state vector and the encrypted current state vector and a binary XOR operation between the encrypted current state vector and the result of the AND operation.

[0034] The computation of the smart contract may include a selection in which the result of an AND operation between the encrypted post-vector and the result of an XOR operation is equal to the transformation of the encrypted post-vector.

[0035] The computation of a smart contract may include conditions where the outcome of the selection is equal to a set of transformations enabled by the current state of the operation.

[0036] Attempting to execute a smart contract may include attempting to satisfy a condition by performing a computation.

[0037] The smart contract may be configured such that successful execution of the smart contract results in integration of a transaction into the blockchain.

[0038] Transactions integrated into the blockchain can represent valid transformations to the current state.

[0039] Creating a smart contract may include verifying that the smart contract complies with a set of rules.

[0040] The software, when executed by a computer, causes the computer to perform the above-described method.

[0041] A system for monitoring current operation of a process, comprising:

[0042] Data storage;

[0043] A processor configured to:

[0044] creating a numerical representation of a nominal operation of the process and storing the created numerical representation on a data store;

[0045] encrypting the numerical representation using homomorphic encryption to determine an encrypted numerical representation that prevents access to the numerical representation but allows computation on the numerical representation;

[0046] creating a smart contract on a blockchain platform using the encrypted numerical representation as a first input to a computation of the smart contract;

[0047] Attempting to execute the smart contract using the current operation of the process as a second input to a computation of the smart contract, the execution of the smart contract generating an output result by performing a computation on the encrypted numerical representation;

[0048] Based on the output of the execution of the smart contract, it is determined that the current operation is outside the nominal operation. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Examples of the present invention will be described with reference to the following:

[0050] Figure 1 An exemplary system is shown.

[0051] Figure 2 A method for monitoring the current operation of a process is shown.

[0052] Figure 3 An example scenario of a main smart contract and subcontracts is shown.

[0053] Figure 4 is a sequence diagram representing an example execution of the main smart contract and subcontracts.

[0054] Figure 5a is an exemplary representation of a process specification as a petri net, Figure 5b is a graphical representation of the numerical state of a process, Figure 5c It is a graphical representation of the fuzzy numerical representation of the state of a process.

[0055] Figure 6a is the matrix representation of the preset state, Figure 6b is the matrix representation of the post-state.

[0056] Figure 7 It is a diagram of homomorphic encryption.

[0057] Figure 8 is an exemplary participant computer node.

[0058] Figure 9a An example of a Petri net that will be executed on the blockchain is provided.

[0059] Figure 9b Exemplary notations are shown to explain how notations can be converted into integers.

[0060] Fig.10a Display positions in ascending order.

[0061] Fig.10b A randomized ordering of the bits corresponding to the positions is shown.

[0062] Fig.11 Shows Figure 9a Matrix representation of the process depicted in .

[0063] Fig.12a Two transformations with matching pre and post are shown.

[0064] Figure 12b Two transitions are shown with matching pre-positions and unique post-positions after adding the silent τ transition. DETAILED DESCRIPTION

[0065] The following disclosure relates to methods and systems for performing or monitoring the current operation of a process. In one example, the invention is applied to a pharmaceutical process having the above parameters and sequence in addition to further process steps and further parameters. In those examples, the term "nominal operation" refers to the process variables / parameters and the sequence of steps specified for the pharmaceutical manufacturing process. However, the invention is equally applicable to other fields, such as intrusion detection of computer systems or other processes.

[0066] Although the present invention describes the use of Ethereum, this is intended only to illustrate a blockchain platform. It should be noted that a blockchain platform may be based on a public ledger (which may be read without restriction or access controlled) or a private ledger that is only accessible to a consortium governed by access control (such as encryption or password protection). One reason for using Ethereum is that it natively supports smart contacts. Smart contracts are objects on the Ethereum blockchain and can hold "eth.accounts" objects. They contain computer code and can interact with other contracts, create new contracts, make decisions, store data, and send Ethereum to other parties. In this document, the term 'smart contract' is used interchangeably to refer to the code for executing a smart contract and the smart contract that is actually executed or executed. For clarity, in the present invention, the term "process example" refers to the execution and services provided by the smart contract.

[0067] The present invention uses the term 'blockchain' to refer to the actual blockchain itself (i.e., a public shared ledger with blocks that are added in sequence). The present invention also uses the term blockchain in relation to blockchain platforms and blockchain networks. The term 'blockchain platform' is intended to refer to all the components that make a blockchain run. This includes wallets, code, transactions, blockchain networks, and the blockchain itself. Examples of blockchain platforms used in the present invention include Bitcoin and Ethereum. Where the term blockchain network (e.g., Ethereum blockchain network) is used, this is intended to mean that computers running blockchain code are able to communicate with each other via a communication network such as the Internet. Computers in a blockchain network are called nodes, and a full node is a computer in a blockchain network that contains a copy of the entire blockchain.

[0068] Exemplary Systems

[0069] Figure 1 An exemplary system 100 for monitoring the current operation of a pharmaceutical process is shown. Computer system 100 includes a smart contract 120, an execution engine 130, and a blockchain 140 including blocks 142, 144, 146, and 148.

[0070] The execution engine 130 creates a numerical representation 134 of the nominal operation of the computer system, representing states of the nominal operation and valid transitions between states.

[0071] Execution engine 130 then encrypts 136 numerical representation 134 using homomorphic encryption to determine encrypted numerical representation 182 that prevents access to the numerical representation but allows computation on the encrypted numerical representation.

[0072] The execution engine 130 uses the encrypted numerical representation as the first input of the smart contract to initiate the smart contract as a process instance on the blockchain platform. The process instance is the execution of the smart contract on the blockchain.

[0073] The execution engine 130 then executes the process instance 170 using the current operation 132 of the computer system as a second input to the process instance, the execution of which generates an output result 190 by performing calculations on the encrypted numerical representation 182 .

[0074] The engine 130 matches 138 the output 190 with the expected result (which should be the encrypted representation 184). If the output result does not match the expected result, the engine 130 determines that the current operation is outside the nominal operation. The same determination can be made for the encrypted representations 186 and 188 stored in the blockchain in blocks 146 and 148, respectively.

[0075] It should be noted that the order of execution of the process example 170 can be determined based on the sequence of states and transformations of the numerical representation. Although the encrypted numerical representation is encrypted, the order of states and transformations will be the same as the numerical representation. This works by utilizing homomorphic encryption, which enables calculations to be performed on an encrypted numerical value that, when decrypted, is the same as the calculations performed on the numerical value itself.

[0076] Exemplary Methods

[0077] Figure 2 An exemplary method is shown. In this example, the system creates 210 a numerical representation of the nominal operation indicating states of the nominal operation and valid transformations between the states. The system then encrypts 220 the numerical representation using homomorphic encryption to determine an encrypted numerical representation that blocks access to the numerical representation but allows computation on the numerical representation.

[0078] The system then creates 230 a smart contract on the blockchain platform using the encrypted numerical representation as a first input to the smart contract, and attempts execution 240 of the smart contract using the current operation of the computer system as a second input to the smart contract, wherein the execution of the smart contract generates an output result by performing a calculation on the encrypted numerical representation. Creating the smart contract in step 230 may include writing the actual string of the smart contract in the syntax used by the blockchain platform, or may include deploying the smart contract to the blockchain platform.

[0079] Finally, the system determines 250 that the current operation is outside the nominal operation based on the output of the execution of the smart contract. For example, the smart contract can be configured so that when the current operation is outside the nominal operation, the smart contract throws an exception. In another example, the smart contract triggers a transaction to a first address (first public key) when the current operation is within the nominal operation, and triggers a transaction to a second address (second public key) when the current operation is outside the nominal operation. In this way, the system can verify the transaction and determine whether the operation is outside the nominal specification. In yet another example, the smart contract is configured so that it does not execute at all unless the current operation is within the nominal specification, and therefore the system can indicate that the current operation is outside the nominal specification when a failure of the smart contract to be executed is detected. In this sense, and in the case where the current operation is outside the nominal specification, the system can allow the current operation and report on it, or block non-compliant operations.

[0080] Exemplary general situation

[0081] An important property of the system is that if a smart contract is executed effectively, the properties of the smart contract verified prior to execution will be maintained. This is advantageous in situations where different parties have executed different parts of a process or where aspects of a process need to remain hidden from other parties in the process and one or more properties of the smart contract are requirements such as compliance or maintaining privacy. That is, although the compliance of the process is verified during design (i.e., before executing the process), this property of the system allows non-deviation from the process to be verified during execution. To further illustrate this point, an example is provided here.

[0082] In this example, one party wants to provide a service without disclosing the details of that service. The other party wants to use that service but wants to ensure that it complies with regulations. Each organization involved in the process is part of the blockchain environment because they can read data from the blockchain.

[0083] Using this system, a party can request the blockchain to verify the compliance level of a stored cryptographic process without accessing the processing details. As a result of using homomorphic encryption, the blockchain can be used to verify the compliance of the cryptographic process.

[0084] The second party can send its encrypted input data to the blockchain for processing. As a result, the owner of the process cannot access the data being processed, nor can any user of the blockchain system. Processing encrypted data is possible due to homomorphic encryption. The process output is also encrypted.

[0085] Business processing of data is performed on the blockchain. An execution trace is provided to allow verification that the selected service has been used (details cannot be inferred from the execution trace as it is encrypted). If required, compliance requirements of nested services can be automatically verified based on the provided rules.

[0086] Additional Elements

[0087] Figure 1 There are some optional additional elements in the . These are explained in more detail below.

[0088] Process Specification

[0089] The process specification 110 contains the details of the process. The process specification 110 is a high-level description of the state transition system of the process, which can be represented as a petri net. That is, the transitions, positions, arcs, and conditions (see below) of the process are defined. As a state transition system, these positions correspond to the conditions for later transitions. The distribution of tokens over the full set of positions in the network (i.e., markings) describes the state. Arcs connect a position to a transition or a transition to a position. The process specification 110 is intended to be a higher-level process description than a smart contract, which contains the code and logic of how the process is executed.

[0090] Main Contract and Subcontract

[0091] Smart contracts 120 may include a main smart contract and one or more subcontracts. The main smart contract contains a description of the process to be performed by each participant and the rules applied to the process.

[0092] In one embodiment, a smart contract may include a main contract and one or more subcontracts. The main contract represents the logic or code that performs the orchestration. These subcontracts are subsets of the smart contract and represent the logic or code that performs one or more smaller functions or operations. In some cases, a subcontract may be a single operation.

[0093] In the examples of the present invention, each conversion is captured in a separate smart contract that is triggered by the main smart contract when appropriate. This is because it is conceivable that in most cases, the main smart contract triggers the subcontract for each conversion to be read. However, in practice, the allocation of logic or code between the main contract and the subcontract will depend on the process and the participants and how the execution of the process is determined. For example, a subcontract may be a fairly complex set of operations, perhaps even more complex than the main contract. It should be noted that in most cases, there will be conversion execution code as part of the subcontract.

[0094] Compliance rules

[0095] The smart contract may include a set of rules against which the process will be measured for the purpose of determining compliance. These compliance rules 150 may include a greater number of rules. For example, they may be company policies 162 or regulations 164, or they may simply be rules that define guidelines requiring various levels of strict compliance. For example, there may be a concern about privacy compliance, which is a company's compliance with established guidelines, norms, or rules for the protection of personal information. Privacy compliance is an increasing concern as more and more rules are designed to protect unauthorized access to personally identifiable information.

[0096] Before the first execution, the smart contract can be checked for compliance by the compliance engine 160 according to a set of compliance rules 150 as outlined in the contract. If the process is compliant, it can be executed. The same applies when the process is composed across a service chain with multiple outsourced providers: before the first execution of the composition, the entire composition is checked for compliance with the rules applicable to the composition (as contained in the main smart contract and related sub-contracts).

[0097] This includes the recursive application of the compliance engine 160 with respect to the smart contract 120 (and subcontracts 122, 124, 126, 128) that it is a part of and to which a given compliance rule 150 is applicable. Only activities that are relevant to the rules are explicitly made. Some are not visible to anyone because their content is not relevant to the compliance of the smart contract.

[0098] It is important to note that the compliance of a process is verified at design time, i.e. before the smart contract is executed. That is, the system does not propose to directly determine the compliance of the process instance being executed. Instead, the compliance of the smart contract can be determined at design time, but at runtime it can be determined that the process is effectively executed and therefore the compliance of the smart contact also applies to the executed process.

[0099] In this paper, it is noted that there are three related concepts of reasonableness, compliance and compliance. Assuming that the deployed process is correct (reasonable, meaning that it always terminates and each of its transformations can potentially be executed), the numerical representation of the process deployed on the blockchain by the smart contract is able to produce every execution within its nominal set of operations. Soundness checks are usually performed before deployment. Assuming reasonableness exists, the smart contract will always execute without failure (except for external reasons).

[0100] Compliance verification refers to the process of verifying that an execution actually belongs to the nominal set of operations of a process. Informally, this verification is required when an organization adopts a third-party program where only a numerical representation of the execution is returned. By performing this compliance verification, the organization can ensure that the execution actually belongs to the nominal set of operations of the process it actually wants to use.

[0101] Compliance is intended to be compliant by design and is verified on the structure of the process, ensuring that each execution belonging to the nominal operation meets the required regulations.

[0102] These three concepts together allow ensuring that a third-party process complies with some given requirements. That is, each possible execution then follows the given requirements, since it is possible to ensure through compliance checking that it belongs to this nominal set of operations.

[0103] Execution Engine

[0104] The process instance 170 may be initiated by executing a smart contract in the execution engine 130 on the blockchain. Most of the code and logic for the execution engine 130 will be found in the execution process instance 170. In the case where the smart contract 120 consists of a main smart contract and sub-contracts, there may be a corresponding process instance for each sub-contract that is different from the process instance 170 corresponding to the main smart contract.

[0105] The following is an example of executing a smart contract in Ethereum as a process instance 170. In the Ethereum platform, the execution and services provided by the contract in its executable form as a process instance 170 are provided by the Ethereum network itself. A smart contract can be started as a process instance 170 as long as the entire network exists, and the process instance 170 will only disappear when the process instance 170 is programmed to self-destruct. Although not provided by default, Solidity-the scripting language used for Ethereum provides the ability to delete a process instance 170.

[0106] The execution engine runs the orchestration of the process as described in the master smart contract. Master contracts and subcontracts can be useful because subcontracts can be distributed and assigned to participants in the process. During the execution of the process, participants can execute their assigned subcontracts. The state representing the current state of the execution can be written to the blockchain by the participants or by the process instance, depending on how the process to be executed is determined.

[0107] In Ethereum, smart contracts must be deployed before they can be executed. To deploy a smart contract as a process instance, the compiled code of the script and the application binary interface (ABI) are required. The ABI defines how to interact with the process instance 170. While the API defines the interface of the source code to be used, the ABI defines the low-level binary interface between two or more software on a dedicated architecture. The ABI defines how the process instance interacts with itself, how the process instance interacts with the Ethereum network, and how the process instance 170 interacts with any code base. When compiling a smart contract script, the compiler will typically produce both compiled code and the ABI.

[0108] During execution, the process state is captured and stored on the blockchain so that the sequence of activities can be traced. Smart contracts executed as instances of the process can manipulate the process state as needed. Thus, participants in the process can perform their part of the process without having access to the process details.

[0109] It is worth noting that stateful data can be stored in a blockchain. For example, there can be a main chain that records and manages process execution and one or more side chains that capture the stateful data of the running process instance. If side chains are used, the stateful data is destroyed once the execution of the process instance is terminated.

[0110] Example Subcontract

[0111] Figure 3 An exemplary scenario with subcontracts is shown. In this example, there are four participants: participant 1310, participant 2320, participant 3330, and participant 4340. Each participant is associated with a node assigned to execute a subcontract. Participant 1310 is assigned to execute subcontract 122, participant 2320 is assigned to execute subcontract 124, participant 3330 is assigned to execute subcontract 126, and participant 4340 is assigned to execute subcontract 128. The main smart contract 120 contains triggers for each subcontract to be executed. The trigger indicates that the participant can execute the relevant subcontract.

[0112] Given the way blockchain systems work, a subcontract can be executed on the blockchain as its own process instance. The subcontract process instance can simply wait for a message from the relevant participant before returning to the main process instance for further execution. In this sense, the subcontract process instance can simply ensure that the transformation occurs and any changes in state are reflected on the blockchain, but the participant can execute any amount of off-chain code that is appropriate for the proper execution of the process. For example, participant 1 might be tasked with returning redacted private data that complies with the rules that require private data to be unidentifiable, but how participant 1 proceeds with redacting the private data is up to participant 1.

[0113] Example execution using subcontracts

[0114] Figure 4 A sequence diagram showing how the above operations are performed. The execution engine 120 can execute 402 the smart contract as a process example 170. For each transformation in the smart contract, there is an associated trigger. In this case, the first transformation triggers 404 the participant 310 to execute 406 the subcontract 122. Once the execution of subcontract 122 occurs, it triggers 408 the participant 320 to execute 410 the subcontract 124. Similarly, the completed execution of 124 triggers 412 the participant 330 to execute 414 the subcontract 126. The completed execution of 126 triggers the execution of subcontract 128.

[0115] Once the subcontract has completed execution, trigger 420 indicates to participant 330 that execution has completed. Similarly, trigger 422 indicates to participant 320 that execution has completed, which then triggers participant 310 to indicate that execution has completed. Finally, participant 310 indicates to the execution engine that the process has completed 120.

[0116] The above example illustrates only one way in which the execution of a subcontract may occur. In another example, the execution engine may trigger each participant instead of the participant itself.

[0117] Numerical representation

[0118] In a formal sense, a state transition system is a pair (S, →) system, where S is a set of states and → is a set of state transitions (i.e., a subset of S×S). A transition from state p to state q (i.e., (p,q)∈→) is written as p→q. A labeled transition system is a tuple (S, Λ, →), where S is a set of states, Λ is a set of labels and → is a set of labeled transitions (i.e., a subset of labeled S×Λ×S). This means that there is a transition from state p with label α to state q. Labels can represent different things. Typical uses of labels include representing expected inputs, conditions that must be true to trigger a transition, or actions performed during a transition.

[0119] Nominal operations can be represented by Petri nets. A Petri net is a directed bigraph whose nodes consist of positions and transitions. Positions represent conditions. The distribution of tokens over the entire set of positions in the network describes states. A transition in a transition system represents a move from one state to the next. In a Petri net, a transition can represent a task, or a transition can be a "silent" ("tau" transition) transition, meaning that it does not correspond to a task but is used to implement a certain control flow. The execution of such a task results in a new state represented by a new token. A Petri net can be transformed into a state transition system and vice versa.

[0120] A labeled Petri net can be defined by a tuple (P, T, A, λ), where P is a set of positions and T is a set of transformations such that is a set of arcs, λ:T→L∪{τ} is a labeling function, where L is a set of labels. A transition is called silent (representing internal, unobservable system behavior) if its corresponding label is τ. A Petri net state (also called a net labeling M:P→N0) is a function that associates each position with a natural number (i.e., a position token). The labeled network N=(P,T,A,λ,M0) is the Petri net (P,T,A,λ) together with the initial labeling M0.

[0121] Positions and transformations are called nodes. The preposition of a node is represented by ·y={x∈P∪T|(x,y)∈A}, and the postposition of a node is represented by y·={z∈P∪T|(y,z)∈A}. + and A * denote the reflection-free and reflection-free transitive closures of A respectively.

[0122] The execution semantics of a Petri net is defined using notations as follows. Then t is called enabled. The firing of t results in a new signature M', where M'(p) = M(p)-1 if p∈·t\t·, M'(p) = M(p)+1 if p∈t·\·t, and M'(p) = M(p) otherwise. If there is a conversion firing sequence σ = t1t2...t n , so that Then mark M n is said to be reachable from M. If Then the marking M of the net is n-safe. If all reachable markings of a Petri net are n-safe, then it is n-safe. The present invention uses a 1-safe net.

[0123] The numerical representation can be obtained by converting the pre- and post-numbers into numerical values ​​as shown below. At any given point in the process instance, the distribution of tokens over the locations represents the execution state. Therefore, the process state of the process instance is stored on the blockchain as an encrypted integer representing the tokens of the petri net representing the smart contract.

[0124] One consequence of utilizing petri nets is that when the underlying process is unknown (eg, by an unauthorized party), the states themselves cannot be reverse engineered because each state is converted to an integer, which is meaningless without knowing the underlying petri net.

[0125] An important aspect of Petri nets is that the distribution of tokens (ie, labels) can be represented numerically. In one example, the numerical representation can be a binary representation of positions that have been marked with 1's and positions that have not been marked with 0s.

[0126] Figure 5a is an example of a petri net that can be executed on a blockchain. In this example, there are multiple positions 508, 510, 512, 514, 516, 518, 520, 522, and 524. State 508 is the initial position, and state 524 is the final position. As in Figure 5a As can be seen in FIG, states 510, 512, 514, 516 form execution branches in parallel with positions 518, 520, and 522. There are also multiple transitions 530, 532, 534, 536, 538, 540, and 542. The purpose of the method is to track subsequent positions (i.e., Petri net markers) on the blockchain so that anyone familiar with the process can identify the Petri net state at a given point in time, while others cannot. That is, the privacy of the process can be maintained.

[0127] Figure 5b is an example of how tokens are transformed into integers. Figure 5b shows an ascending order of positions. Each position is represented by a bit in the bit array. Whenever that position contains a token, the corresponding bit is set to 1, otherwise to 0. Thus, if the execution of petri net 5a is currently in state {512,518}, this would correspond to an integer equal to 36. However, when the positions are arranged in ascending order, it is easy to identify several states without actually knowing the underlying process. For example, state 1 indicates the initial state, and if no state above 256 is observed, then 256 indicates the final state. To address this problem, Figure 5c The order of the bits corresponding to the positions is randomized so that the bit transitions cannot be reversed into the execution of a dedicated activity for any state. In this example, the notation {512,518} corresponds to an integer equal to 5.

[0128] Verify state changes

[0129] In a more complex variation, the execution state of a process in a smart contract can be represented as a matrix. Fig.11 An exemplary matrix is ​​shown. The matrix represents all transformation presets (at A) which are input locations to the transformation. Fig.11Represents the set of all transformation postpositions (in B), which are the output positions to the transformation. Using the matrix in this way, it is possible to determine which positions are valid output positions for the transformation, and therefore determine whether the execution of the process occurs in a valid order. Note that each column of the matrix does not involve the "state" of the process, as it only indicates which positions are in the preset of the transformation by having 1 instead of 0 in the matrix. All positions in the preset require a token to enable the transformation. However, when a certain transformation T is enabled (i.e., it can be executed), there may be more positions that have tokens. Because these positions are not in the preset of T, they are not related to the enabling and firing of T. There can be multiple transformations that "fill" the preset (partially) at the same time. This allows identification of whether subsequent executions on the blockchain are valid (i.e., whether they are allowed by the Petri net).

[0130] If the execution state is currently in state S1{512,518}. State vector

[0131] V s1 =[0,0,1,0,0,1,0,0,0]

[0132] A mark reflecting the current state can be generated. This can be performed by the state vector Figure 6a Binary operation on each column in determines the set of enabled transformations in this state. Transformation vector

[0133] V T1= [0,0,1,0,1,0,0]

[0134] Represents transition T1{534,538} enabled in state S1.

[0135] As described above, the process specification 110 may define valid states and transformations of the process, and the process specification 110 may be used to verify the execution of the process, that is, whether each of the execution states of the process is within a valid state of the process specification 110 and whether each of the enabled transformations at the corresponding state is a valid enabled transformation of the process specification 110.

[0136] In order to identify whether a pair of subsequent states is caused by a valid transition, the following test can be performed. State S2 is represented by vector V s2= [0,0,1,0,0,0,0,1,0] means,

[0137] It represents the next state after S1. Figure 6b The postposition set in can be used to determine the postposition set of the transformation performed between S1 and S2. Subsequently, a set of transformations performed to obtain the new state S2 can be determined. If the set of transformations performed does not match T1, then the movement from state S1 to state S2 constitutes the execution of one or more transformations not allowed by the process specification 110.

[0138] Homomorphic encryption

[0139] Homomorphic encryption is a form of encryption that allows computations to be performed on ciphertext, producing an encrypted result that, when decrypted, matches the results of the operations as if they had been performed on the plaintext. The purpose of homomorphic encryption is to allow computations to be performed on encrypted data.

[0140] In the present invention, the process state is preferably encrypted using homomorphic encryption, so that the process state is available to the owner of the process but not to other participants of the process.

[0141] Figure 7 A diagram showing how homomorphic encryption works. Numerical representation 710 may be encrypted 712 into encrypted numerical representation 720. Operation 714 may be performed on encrypted numerical representation 720 to produce modified encrypted numerical representation 730. Modified encrypted numerical representation 730 may be decrypted 716 to produce output 740, which is equivalent to performing the same operation 714 on numerical representation 710.

[0142] exist Figure 7 , dotted line 750 represents a boundary for publicly sharing numerical representations. That is, the encrypted numerical representation 720 and the modified encrypted numerical representation 730 can be publicly shared. In addition, the encrypted numerical representation 720 can also be publicly modified 714. In the present invention, the state of a process can be encrypted and modified. That is, the state of a process can change during the process of performing the process, but the details of the process or the state of the process itself will not be revealed. Only those participants who can decrypt the encrypted numerical representation can determine the details of the process or the state of the process.

[0143] The present invention considers three types of homomorphic encryption: additive homomorphic, multiplicative homomorphic, and fully homomorphic. In additive homomorphic encryption, operation 714 is an addition operation. Similarly, in multiplicative homomorphic encryption, operation 714 is a multiplication operation. In fully homomorphic encryption, operation 714 is arbitrary. Additive homomorphic encryption is all that is needed, as a given state can be easily modified to another state simply by basic operations. However, multiplication and fully homomorphic encryption can also work.

[0144] Example Participants

[0145] Each participant in the process may need a computer node that can interact with the blockchain system. Figure 8 The node includes a processor 802, a memory 810, a blockchain interface device 806, and a network interface device 807 that communicate with each other via a bus 804. The memory stores the information for reference. Figures 1 to 7Instructions 812, 814, and 816 and data of the described systems and processes, and the processor executes the instructions from memory to implement these processes.

[0146] The processor 802 executes instructions stored on the memory 810. The processor 802 receives a trigger by determining a state change on the blockchain from the network interface device 806. The processor 802 determines instructions from the instruction module 812, which may include executing a subcontract or function to communicate with the process example 170. The processor can execute instructions in the storage module 814 to store data on the blockchain. The processor 802 can execute instructions stored in the interface module 816 to communicate with the interface 807 to interface with other participants without having to utilize the blockchain.

[0147] Further examples

[0148] As described above, the process state is represented as a numerical representation, such as a set of bits. Each subsequent state of the process (represented as a Petri net notation) is stored on the blockchain in the form of a smart contract created by the processor 802, so that the execution of the process can be monitored. In order to ensure that when the underlying process is unknown (for example, executed by an unauthorized party), the state itself cannot be reverse-crashed, each state is converted into an integer (also part of the numerical representation), which is meaningless without knowing the underlying Petri net.

[0149] Figure 9a An example of a Petri net representing the nominal (i.e., compliant) operations of a process to be executed on a blockchain is provided. The challenge here is to track subsequent states (i.e., Petri net notations) on the blockchain such that anyone familiar with the process (i.e., having access to the unencrypted data) can identify the Petri net state at a given point in time, while others (i.e., not having access to the unencrypted data) cannot. Additionally, the goal is to avoid the key distribution problem, meaning that the method avoids encryption of the state itself. Thus, disclosed herein is a method for converting a given Petri net notation into a numerical representation in the form of integers, which cannot be used to derive subsequent process steps or even the actual state of the process without knowing the underlying process.

[0150] Figure 9b Exemplary notations are shown for explaining how to convert notations into integers. Fig.10aThe positions are shown in ascending order. Each position is represented by a bit in the bit array. Whenever that position contains a token, the corresponding bit is set to 1, otherwise to 0. Thus, the notation {p3,p6} shown corresponds to an integer equal to 36. However, when the positions are arranged in ascending order, several states are easily identified without actually knowing the underlying process. For example, state 1 indicates the initial state, and if no state higher than 256 is observed, then 256 indicates the final state. To address this problem, Fig.10b The order of the bits corresponding to the positions is randomized so that the bit transitions cannot be reversed into the execution of a dedicated activity for any state. In this example, the notation {p3, p6} corresponds to an integer of 5 equal to .

[0151] Table 1 below shows the Fig.10b An example of subsequent notation of the execution of the transformed Petri net and the corresponding state representation.<A,B,C,E,D,F,G> The array of subsequent states will be [32,20,5,68,66,258,384].

[0152]

[0153]

[0154] Table 1

[0155] When executions C and E are swapped, the array of subsequent states will be [32, 20, 5, 3, 66, 258, 384], as shown in Table 2 below. Note that only one state is different. In addition, it is easy to check for "impossible" states, i.e., states that constitute a marking that is not allowed by the underlying Petri net (e.g., {p2}).

[0156] Conversion mark Bit Array state -- <![CDATA[{p1}]]> 000100000 32 A <![CDATA[{p2,p6}]]> 000010100 20 B <![CDATA[{p3,p6}]]> 000000101 5 E <![CDATA[{p3,p7}]]> 000000011 3 C <![CDATA[{p4,p7}]]> 001000100 66 D <![CDATA[{p5,p7}]]> 100000010 258 F <![CDATA[{p5,p8}]]> 110000000 384 G <![CDATA[{p9}]]> 000001000 8

[0157] Table 2

[0158] The following description provides the bitset operations performed by the simulation process. The bitset operations can then be encoded as smart contracts on the blockchain. Fig.11 Shows Figure 9a A matrix representation of the process depicted in . The columns represent transformations, with 1's indicating where in the pre- or post-set each transformation is (row).

[0159] Submatrix A represents all pre-settings, while submatrix B represents post-settings. Consider the state vector C shown in the following table, which represents the state of the process at a certain point in time. That is, vector C represents the flags that enable C and E.

[0160] <![CDATA[p1]]> <![CDATA[p2]]> <![CDATA[p3]]> <![CDATA[p4]]> <![CDATA[p5]]> <![CDATA[p6]]> <![CDATA[p7]]> <![CDATA[p8]]> <![CDATA[p9 <!-- 12 -->]]> 0 0 1 0 0 1 0 0 0

[0161] Table 3

[0162] Then, the state vector C is used to perform a binary operation on each column i in A, generating a set of enabled transformations E as follows:

[0163]

[0164] The following table shows the vector E indicating the enabled transition in state C:

[0165] A B C D E F G 0 0 1 0 1 0 0

[0166] Table 4

[0167] Subsequently, E×{A,B,C,D,E,F,G} returns the set {C,E}, which represents the enabled transformations. i When ignition is started, the new state C′ is defined as follows: Note that in Tables 3 and 4, the position and transformation labels are used only for readability purposes, as they are not present in the corresponding vectors.

[0168] To identify whether a pair of subsequent states results from a valid transition, the following test may be performed: Assume that we have a subsequent state C2 (shown in Table 5) following C in Table 3.

[0169] <![CDATA[p1]]> <![CDATA[p2]]> <![CDATA[p3]]> <![CDATA[p4]]> <![CDATA[p5]]> <![CDATA[p6]]> <![CDATA[p7]]> <![CDATA[p8]]> <![CDATA[p9]]> 0 0 1 0 0 0 0 1 0

[0170] Table 5: Vector C2.

[0171] From here, processor 802 can calculate To obtain the postposition set representing the transformation performed between C and C2:

[0172] <![CDATA[p1]]> <![CDATA[p2]]> <![CDATA[p3]]> <![CDATA[p4]]> <![CDATA[p5]]> <![CDATA[p6]]> <![CDATA[p7]]> <![CDATA[p8]]> <![CDATA[p9]]> 0 0 0 0 0 0 0 1 0

[0173] Next, processor 802 obtains a set of transformations that are fired to obtain a new tag:

[0174]

[0175] This means that the numerical representations of the processes stored in A and B are used as inputs to the computation of the smart contract encoding the above equation. More specifically, the above equation (and the smart contract) includes the following: ) and the nominal vector B i Similarly, this calculation is also based on the previous state vector C.

[0176] Finally, if Then the move from C to C2 constitutes the execution of one or more transformations in state that are not permitted by the process specification. Note that obtaining E and The formula assumes that the underlying Petri net is reasonable, and more specifically, that there are no transitions with empty prepends or postpends. That is:

[0177] Conversions with matching pre and post

[0178] The above state conversion method works well in the example where each conversion has a unique pre-pair and post-pair. i =·t j ^t i =t j There are no two transformations t i and t j .However, Fig.12a An example is shown where a simple XOR split and subsequent XOR join already violates this assumption, where A and B share the same preamble (ie, p1) and the same postamble (ie, p2).

[0179] Therefore, the state transition from label {p1} to {p2} does not provide any information whether A or B has been executed. This problem can be solved by adding a so-called silent or τ transition to each exclusive branch, so that each visible transition (ie A and B) has a unique postposition. Figure 12b This idea is illustrated graphically, where A·={p3} and B·={p4}.

[0180] Those skilled in the art will appreciate that many changes and / or modifications may be made to the above-described embodiments without departing from the broad general scope of the invention. Therefore, the present embodiments are to be considered in all aspects as illustrative and not restrictive.

[0181] Those skilled in the art will appreciate that many changes and / or modifications may be made to the above-described embodiments without departing from the broad general scope of the invention. Therefore, the present embodiments are to be considered in all aspects as illustrative and not restrictive.

Claims

1. A method for monitoring the current operation of a computer system, the method comprising: Creating a petri net of the nominal operation of the computer system and creating a numerical representation of the petri net to create a numerical representation of the nominal operation of the computer system, wherein the numerical representation indicates the effective conversion between the nominal operating position and the position, consists of multiple binary nominal vectors, Each of the plurality of binary nominal vectors represents one of the valid conversions between positions, and The current operation of the computer system is represented by a binary current state vector; encrypting the numerical representation using homomorphic encryption to determine an encrypted numerical representation, including an encrypted nominal vector, the encrypted numerical representation preventing access to the numerical representation but allowing computation on the numerical representation; creating a smart contract on a blockchain platform using the encrypted numerical representation as a first input to a computation of the smart contract, the smart contract comprising binary operations based on the binary current state vector and the encrypted nominal vector; attempting to execute the smart contract using the current operation of the computer system as a second input to the computation of the smart contract, the execution of the smart contract generating an output result by performing the computation on the encrypted numerical representation; Based on an output of the execution of the smart contract and in response to determining a failure to execute the smart contract, it is determined that the current operation of the computer system is outside of the nominal operation. 2 . The method of claim 1 , further comprising preventing current operation of the computer system upon determining that the current operation is outside of the nominal operation.

3. The method of claim 1, further comprising, upon determining that the current operation is outside the nominal operation, allowing further execution of the computer system and generating a report indicating that the current operation is outside the nominal operation.

4. The method according to claim 1, wherein: The plurality of binary nominal vectors includes, for each transformation, a binary pre-vector indicating one or more positions at which the transformation is enabled and a binary post-vector indicating one or more possible positions after the transformation.

5. The method according to claim 1, wherein: Creating the numerical representation includes determining a plurality of traces passing through the locations and translations, and determining a pre-vector and a post-vector such that the pre-vector and the post-vector represent the plurality of traces.

6. The method according to claim 1, wherein: The computation of the smart contract includes binary operations based on a previous state vector indicating a previous state of the operation.

7. The method according to claim 6, wherein: The calculation of the smart contract includes binary operations between the encrypted previous state vector and the encrypted current state vector.

8. The method according to claim 7, wherein: The calculation of the smart contract includes binary operations based on the use of an encrypted post-vector and transformation selection based on the encrypted post-vector.

9. The method according to claim 7 or 8, wherein: The calculation of the smart contract includes a binary AND operation between the encrypted previous state vector and the encrypted current state vector and a binary XOR operation between the encrypted current state vector and the result of the AND operation.

10. The method according to claim 9, wherein: The calculation of the smart contract includes the selection of a transformation, wherein the result of an AND operation between the encrypted post-vector and the result of the XOR operation is equal to the encrypted post-vector.

11. The method according to claim 8, 9 or 10, wherein: The computation of the smart contract includes the condition that the result of the selection is equal to a set of transformations enabled by the current state of the operation.

12. The method according to claim 11, wherein: Attempting to execute the smart contract includes attempting to satisfy a condition by performing the computation.

13. The method according to claim 1, wherein: The smart contract is configured such that successful execution of the smart contract results in integration of a transaction into the blockchain.

14. The method according to claim 13, wherein: The transaction incorporated into the blockchain represents a valid transformation to the binary current state vector.

15. The method according to claim 1, wherein: Creating the smart contract includes verifying compliance of the smart contract against a set of rules.

16. A non-transitory computer readable medium having software codes stored thereon, which, when executed by a computer, cause the computer to perform the method of claim 1.

17. A monitoring system for monitoring the current operation of a computer system, the monitoring system comprising: Data storage; The processor is configured as: Creating a petri net of nominal operations and creating a numerical representation of the petri net to create a numerical representation of the nominal operations of the computer system, and storing the created numerical representation on a data storage device, wherein the numerical representation indicates the effective conversion between the nominal operating position and the position, consists of multiple binary nominal vectors, Each of the plurality of binary nominal vectors represents one of the valid conversions between positions, and The current operation of the computer system is represented by a binary current state vector; encrypting the numerical representation using homomorphic encryption to determine an encrypted numerical representation, including an encrypted nominal vector, the encrypted numerical representation preventing access to the numerical representation but allowing computation on the numerical representation; Using the encrypted numerical representation as a first input to a computation of a smart contract, creating the smart contract on a blockchain platform, the smart contract comprising binary operations based on the binary current state vector and the encrypted nominal vector; attempting to execute the smart contract using the current operation of the computer system as a second input to a computation of the smart contract, the execution of the smart contract generating an output result by performing a computation on the encrypted numerical representation; Based on an output of the execution of the smart contract and in response to determining a failure to execute the smart contract, it is determined that the current operation of the computer system is outside of the nominal operation.