An algebraic algorithm for structural validation of social protocols

Authors:
Willy Picard
Affiliations:
Department of Information Technology, The Poznan University of Economics, Poznan, Poland
Venue:
BIS'07 Proceedings of the 10th international conference on Business information systems
Year:
2007

Citing 7
Cited 1

Verification problems in conceptual workflow specifications

Data & Knowledge Engineering - Special issue on ER '96
Adaptive workflow

Enterprise information systems
Analyzing process models using graph reduction techniques

Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
Verification Problems in Conceptual Workflow Specifications

ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
Data flow and validation in workflow modelling

ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Specification and validation of process constraints for flexible workflows

Information Systems
DynG: a protocol-based prototype for non-monolithic electronic collaboration

CSCWD'05 Proceedings of the 9th international conference on Computer Supported Cooperative Work in Design II

Support for adaptive collaboration in Professional Virtual Communities based on negotiations of social protocols

International Journal of Information Technology and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Support for human-to-human interactions over a network is still insufficient. In this paper a model for human-to-human collaboration based on the concept of social protocol is presented and formalized. Then, semantical and structural validity of social protocols is defined. Next, an algebraic representation of social protocols is proposed. Based on this algebraic representation of social protocols, an algorithm for structural validation of social protocols is proposed and illustrated by three examples.