Bibliothek

Sprache
Bevorzugter Suchindex
Ergebnisse pro Seite
Sortieren nach
Sortierung
Anzahl gespeicherter Suchen in der Suchhistorie
E-Mail-Adresse
Voreingestelltes Exportformat
Voreingestellte Zeichencodierung für Export
Anordnung der Filter
Maximale Anzahl angezeigter Filter
Autovervollständigung
Feed-Format
Anzahl der Ergebnisse pro Feed
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Formal methods in system design 11 (1997), S. 111-112 
    ISSN: 1572-8102
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Formal methods in system design 11 (1997), S. 137-155 
    ISSN: 1572-8102
    Schlagwort(e): Formal verification ; model checking ; real-time systems ; duration properties
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We present a verification algorithm for duration properties of real-time systems. While simple real-time properties constrain the total elapsed time between events, duration properties constrain the accumulated satisfaction time of state predicates. We formalize the concept of durations by introducing duration measures for timed automata. A duration measure assigns to each finite run of a timed automaton a real number —the duration of the run— which may be the accumulated satisfaction time of a state predicate along the run. Given a timed automaton with a duration measure, an initial and a final state, and an arithmetic constraint, the duration-bounded reachability problem asks if there is a run of the automaton from the initial state to the final state such that the duration of the run satisfies the constraint. Our main result is an (optimal) PSPACE decision procedure for the duration-bounded reachability problem.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Formal methods in system design 1 (1992), S. 385-415 
    ISSN: 1572-8102
    Schlagwort(e): finite-state system ; timers ; verification ; reachability analysis ; shortest path
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We consider a finite-state system with a finite number of clocks, where the transitions may depend on the values of the clocks, and may reset some of the clocks. We address the complexity and provide algorithms for the following problems. Suppose that the system starts from a given current state with a given assignment of values to the clocks. Can a given target state ever appear in the history of the system? What is the earliest time it can appear? What is the latest time it can appear?
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Telecommunication systems 15 (2000), S. 323-343 
    ISSN: 1572-9451
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Elektrotechnik, Elektronik, Nachrichtentechnik
    Notizen: Abstract Operators of multi‐service networks require simple charging schemes with which they can fairly recover costs from their users and effectively allocate network resources. This paper studies an approach for computing such charges from simple measurements (time and volume), and relating these to bounds of the effective bandwidth. To achieve economic efficiency, it is necessary that usage‐based charging schemes capture the relative amount of resources used by connections. Based on this criteria, we evaluate our approach for real traffic consisting of Internet Wide Area Network traces and MPEG‐1 compressed video. Its incentive compatibility is shown with an example involving deterministic multiplexing, and the effect of pricing on a network's equilibrium is investigated for deterministic and statistical multiplexing. Finally, we investigate the incentives for traffic shaping provided by the approach.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Queueing systems 5 (1989), S. 37-54 
    ISSN: 1572-9443
    Schlagwort(e): Stability ; control strategies ; inventory processes
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Consider a production system that consists ofm machines each of which can produce parts ofn types. When machinek is used, it produces a part of typei with probabilityp ki . Requests arrive for parts, one at a time. With probability λ i an arriving request is for a part of typei. The requests must be served without waiting. Thus, if a requested part is not available, it must be produced. We find necessary and sufficient conditions for the existence of a strategy (a choice of the machines to be used) which makes the inventory of parts stable and we provide such a strategy. Two variations of this model are also considered: the case of batch arrivals of requests, and that of a system where the requests can be queued.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Telecommunication systems 12 (1999), S. 167-191 
    ISSN: 1572-9451
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Elektrotechnik, Elektronik, Nachrichtentechnik
    Notizen: Abstract Accurate yet simple methods for traffic engineering are important for efficient management of resources in broadband networks. The goal of this paper is to apply and evaluate large deviation techniques for traffic engineering. In particular, we employ the recently developed theory of effective bandwidths, where the effective bandwidth depends not only on the statistical characteristics of the traffic stream, but also on a link’s operating point through two parameters, the space and time parameters, which can be computed using the many sources asymptotic. We show that this effective bandwidth definition can accurately quantify resource usage. Furthermore, we estimate and interpret values of the space and time parameters for various mixes of real traffic demonstrating how these values can be used to clarify the effects on the link performance of the time scales of traffic burstiness, of the link resources (capacity and buffer), and of traffic control mechanisms such as traffic shaping. Our experiments involve a large set of MPEG‐1 compressed video and Internet Wide Area Network (WAN) traces, as well as modeled voice traffic.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Buch
    Buch
    West Sussex [u.a.] :Wiley,
    Titel: Pricing communication networks /
    Autor: Courcoubetis, Costas
    Beteiligte Person(en): Weber, Richard
    Verlag: West Sussex [u.a.] :Wiley,
    Erscheinungsjahr: 2003
    Seiten: XX, 357 p. : , graph. Darst.
    Serie: Wiley-Interscience series in systems and optimization
    ISBN: 0-470-85130-9
    Materialart: Buch
    Sprache: Unbestimmte Sprache
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...