. "Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems" . "Client-Server systems; formal verification; infinite state systems; component-based system analysis"@en . . "2008-09-10+02:00"^^ . . "1571-0661" . . "3"^^ . "Huta\u0159ov\u00E1 Va\u0159ekov\u00E1, Ivana" . "15"^^ . . "3"^^ . . "14330" . "Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems" . "[895A28103DF8]" . . . . "RIV/00216224:14330/08:00024304" . . . . . "M\u00E1laga, Spain" . "357372" . "M\u00E1laga, Spain" . . "Department of Computer Science, University of M\u00E1laga" . "Proceedings of the International Workshop on Formal Aspects of Component Software (FACS'08)" . . "P(1ET400300504), P(1ET408050503), P(1M0545)" . . "\u010Cern\u00E1, Ivana" . "Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems"@en . "In many real software systems like Client-Server systems, one can identify a stable part and a number of uniform components of the same type. When analysing performance and correctness of these systems we need to answer questions like %22What is the maximal possible number of clients which can be handled simultaneously?%22 or more generally %22What is the maximal possible number of clients which are in the some special situation when the control component is in a particular state?%22. In the paper we propose an automated technique solving such questions. For Client-Server systems we reduce the problem of finding the upper bound on the number of handled clients to the formal verification of reachability properties in infinite state transition systems. For the verification task we propose an efficient and fully automated algorithm which combines several techniques proposed in existing literature. Applying the algorithm we verify models of several previously published systems." . . . . "In many real software systems like Client-Server systems, one can identify a stable part and a number of uniform components of the same type. When analysing performance and correctness of these systems we need to answer questions like %22What is the maximal possible number of clients which can be handled simultaneously?%22 or more generally %22What is the maximal possible number of clients which are in the some special situation when the control component is in a particular state?%22. In the paper we propose an automated technique solving such questions. For Client-Server systems we reduce the problem of finding the upper bound on the number of handled clients to the formal verification of reachability properties in infinite state transition systems. For the verification task we propose an efficient and fully automated algorithm which combines several techniques proposed in existing literature. Applying the algorithm we verify models of several previously published systems."@en . . "Moravcov\u00E1 Va\u0159ekov\u00E1, Pavl\u00EDna" . "Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems"@en . . "RIV/00216224:14330/08:00024304!RIV10-MSM-14330___" .