Checking Satisfiability Aspects of Binding Constraints in a Business Process Context

Lecture Notes in Business Information Processing - Germany
doi 10.1007/978-3-642-28115-0_44
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Detecting and Resolving Conflicts of Mutual-Exclusion and Binding Constraints in a Business Process Context

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Checking Business Process Evolution

Science of Computer Programming
Software
2019English

Optimal Satisfiability Checking for Arithmetic $$\Mu $$ -Calculi

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Towards Aspects Identification in Business Process Through Process Mining

2015English

A Theorem Prover for Checking Satisfiability of Object-Oriented Database Schemas

1995English

Alignment of Business, Architecture, Process, and Organisation in a Software Development Context

2012English

Preserving the Context of Interrupted Business Process Activities

2005English

Understanding Process Quality in the Context of Collaborative Business Network Structures

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy