DIPES '98 Proceedings of the IFIP WG10.3/WG10.5 international workshop on Distributed and parallel embedded systems
Generating statechart designs from scenarios
Proceedings of the 22nd international conference on Software engineering
MAS — an interactive synthesizer to support behavioral modelling in UML
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Negative scenarios for implied scenario elicitation
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Synthesis of Behavioral Models from Scenarios
IEEE Transactions on Software Engineering
Inference of Message Sequence Charts
IEEE Transactions on Software Engineering
Predicting tie strength with social media
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Detecting implied scenarios analyzing non-local branching choices
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
The little engine(s) that could: scaling online social networks
Proceedings of the ACM SIGCOMM 2010 conference
Inference in Hidden Markov Models
Inference in Hidden Markov Models
Hi-index | 0.00 |
Social networks are ever-growing systems by inheritance. The increase in the number nodes in these systems often brings forth the need to add additional functionalities. However due to the distributed nature of social networks, system growth can be a challenging task. Therefore scalability of the system is of vital importance in the design of social networks. This research attempts to establish a comprehensive framework for analysis and validation of requirements and design documents for software systems. In previous work, we applied this framework to analyze the requirements of a social network of agents; expressed using scenario-based specifications. Scenarios are appealing because of their expressive power and simplicity. Moreover due to the clear and concise notation of scenarios, they can be used to analyze the system requirements for general validity, lack of deadlock, and existence of emergent behavior. In this paper a methodology to analyze the scalability of social networks is presented. This methodology is devised to indicate whether or not the new requirements of the system are consistent with the current requirements in place. A larger prototype of a social network of MSA for semantic search is utilized to illustrate the developed methodology.