Results 1  10
of
256,404
Verification of Infinitestate Systems
, 2000
"... ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder nonregular ..."
Abstract
 Add to MetaCart
ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder non
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
A theory of communicating sequential processes
, 1984
"... A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account. ..."
Abstract

Cited by 4135 (17 self)
 Add to MetaCart
A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.
Requirements for Internet Hosts  Communication Layers
 RFC1812] [RFC2277] Baker, F., "Requirements for IP Version 4 Routers", RFC 1812
, 1989
"... This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This is one RFC of a pair that defines and discusses the r ..."
Abstract

Cited by 521 (6 self)
 Add to MetaCart
the requirements for Internet host software. This RFC covers the communications protocol layers: link layer, IP layer, and transport layer; its companion RFC1123 covers the application and support protocols.
The Vocabulary Problem in HumanSystem Communication
 COMMUNICATIONS OF THE ACM
, 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract

Cited by 551 (8 self)
 Add to MetaCart
In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five applicationrelated domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability <0.20. Simulations show how this fundamental property of language limits the success of various design methodologies for vocabularydriven interaction. For example, the popular approach in which access is via one designer's favorite single word will result in 8090 percent failure rates in many common situations. An optimal strategy, unlimited aliasing, is derived and shown to be capable of severalfold improvements.
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical
On Reachability And Safety In InfiniteState Systems
"... We introduce some new models of infinitestate transition systems. The basic model, called a (reversalbounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversalbounded counters (i.e. each counter can be incremented or decremented by 1 and tested ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce some new models of infinitestate transition systems. The basic model, called a (reversalbounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversalbounded counters (i.e. each counter can be incremented or decremented by 1 and tested
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
SelfSimilarity Through HighVariability: Statistical Analysis of Ethernet LAN Traffic at the Source Level
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is selfsimilar or longrange dependent in nature (i.e., bursty over a wide range of time scales)  in sharp contrast to commonly made tr ..."
Abstract

Cited by 740 (24 self)
 Add to MetaCart
traffic modeling assumptions. In this paper, we provide a plausible physical explanation for the occurrence of selfsimilarity in LAN traffic. Our explanation is based on new convergence results for processes that exhibit high variability (i.e., infinite variance) and is supported by detailed statistical
Results 1  10
of
256,404