Behaviour preserving refinements of Petri nets
International Workshop WG '86 on Graph-theoretic concepts in computer science
A survey of behaviour and equivalence preserving refinements of Petri nets
APN 90 Proceedings on Advances in Petri nets 1990
Adding action refinement to a finite process algebra
Information and Computation
Free choice Petri nets
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Behavior-consistent specialization of object life cycles
ACM Transactions on Software Engineering and Methodology (TOSEM)
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques
Business Process Management, Models, Techniques, and Empirical Studies
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Tool Support for Verifying UML Activity Diagrams
IEEE Transactions on Software Engineering
Ontology Matching
On Architectural Support For Behaviour Refinement In Distributed Systems Design
Journal of Integrated Design & Process Science
Matching and Merging of Statecharts Specifications
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Semantics and analysis of business process models in BPMN
Information and Software Technology
Measuring Similarity between Business Process Models
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Aligning Business Process Models
EDOC '09 Proceedings of the 2009 IEEE International Enterprise Distributed Object Computing Conference (edoc 2009)
A feature-complete Petri net semantics for WS-BPEL 2.0
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
The ICoP Framework: identification of correspondences between process models
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Efficient Consistency Measurement Based on Behavioral Profiles of Process Models
IEEE Transactions on Software Engineering
Evaluation of technical measures for workflow similarity based on a pilot study
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Simulation-Based graph similarity
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Identifying refactoring opportunities in process model repositories
Information and Software Technology
Perceived consistency between process models
Information Systems
Business process model abstraction: a definition, catalog, and survey
Distributed and Parallel Databases
State propagation in abstracted business processes
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Assessing the replaceability of service protocols in mediated service interactions
Future Generation Computer Systems
Matching business process workflows across abstraction levels
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
A framework for behavior-consistent specialization of artifact-centric business processes
BPM'12 Proceedings of the 10th international conference on Business Process Management
Isotactics as a foundation for alignment and abstraction of behavioral models
BPM'12 Proceedings of the 10th international conference on Business Process Management
Design for service compatibility
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Compatibility of two process models can be verified using common notions of behaviour inheritance. However, these notions postulate 1:1 correspondences between activities of both models. This assumption is violated once activities from one model are refined or collapsed in the other model or in case there are groups of corresponding activities. Therefore, our work lifts the work on behaviour inheritance to the level of complex 1:n and n:m correspondences. Our contribution is (1) the definition of notions of behaviour compatibility for models that have complex correspondences and (2) a structural characterisation of these notions for sound free-choice process models that allows for computationally efficient reasoning. We show the applicability of our technique, by applying it in a case study in which we determine the compatibility between a set of reference process models and models that implement them.