Abstract: In one embodiment the present invention includes a method of determining whether computer processes can interact without deadlocks. The computer processes may be modeled in a process modeling language. The method includes (optionally) generating state diagrams from the processes as modeled by process modeling language, generating step actions from the state diagrams, and executing model checking on the step actions. A computer program may implement the method, and a computer system may execute the computer program. Performing model checking on processes modeled by the process modeling language allows for increased interoperability checking.

Abstract: In one embodiment the present invention includes a method of determining whether computer processes can interact without deadlocks. The computer processes may be modeled in a process modeling language. The method includes (optionally) generating state diagrams from the processes as modeled by process modeling language, generating step actions from the state diagrams, and executing model checking on the step actions. A computer program may implement the method, and a computer system may execute the computer program. Performing model checking on processes modeled by the process modeling language allows for increased interoperability checking.