About: Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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)
Title	Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems (en)
skos:prefLabel	Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems (en)
skos:notation	RIV/00216224:14330/08:00024304!RIV10-MSM-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1ET400300504), P(1ET408050503), P(1M0545)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Černá, Ivana Moravcová Vařeková, Pavlína Hutařová Vařeková, Ivana
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	357372
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/08:00024304
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Client-Server systems; formal verification; infinite state systems; component-based system analysis (en)
http://linked.open.../riv/klicoveSlovo	infinite state systems formal verification Client-Server systems component-based system analysis
http://linked.open...ontrolniKodProRIV	[895A28103DF8]
http://linked.open...v/mistoKonaniAkce	Málaga, Spain
http://linked.open...i/riv/mistoVydani	Málaga, Spain
http://linked.open...i/riv/nazevZdroje	Proceedings of the International Workshop on Formal Aspects of Component Software (FACS'08)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Techniques for automatic verification and validation of software and hardware systems Realistic application of formal methods in component systems
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Černá, Ivana Moravcová Vařeková, Pavlína Hutařová Vařeková, Ivana
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2008-09-10 (xsd:date)
issn	1571-0661
number of pages	15 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Department of Computer Science, University of Málaga
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software