Results 1  10
of
1,791
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 685 (12 self)
 Add to MetaCart
on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various modelchecking techniques that were originally developed for finite
Analysis, Modeling and Generation of SelfSimilar VBR Video Traffic
, 1994
"... We present a detailed statistical analysis of a 2hour long empirical sample of VBR video. The sample was obtained by applying a simple intraframe video compression code to an action movie. The main findings of our analysis are (1) the tail behavior of the marginal bandwidth distribution can be accu ..."
Abstract

Cited by 548 (6 self)
 Add to MetaCart
be accurately described using "heavytailed" distributions (e.g., Pareto); (2) the autocorrelation of the VBR video sequence decays hyperbolically (equivalent to longrange dependence) and can be modeled using selfsimilar processes. We combine our findings in a new (nonMarkovian) source model
Finitary Sketches
, 1997
"... Finitary sketches, i.e., sketches with finitelimit and finitecolimit specifications, are proved to be as strong as geometric sketches, i.e., sketches with finitelimit and arbitrary colimit specifications. Categories sketchable by such sketches are fully characterized in the infinitary firstorder ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
order logic: they are axiomatizable by oecoherent theories, i.e., basic theories using finite conjunctions, countable disjunctions, and finite quantifications. The latter result is absolute; the equivalence of geometric and finitary sketches requires (in fact, is equivalent to) the non
Trace and Testing Equivalence on Asynchronous Processes
 Information and Computation
, 1999
"... We study trace and maytesting equivalences in the asynchronous versions of CCS and calculus. We start from the operational definition of the maytesting preorder and provide for it finitary and fully abstract tracebased characterizations, along with a complete inequational proof system. We also ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
We study trace and maytesting equivalences in the asynchronous versions of CCS and calculus. We start from the operational definition of the maytesting preorder and provide for it finitary and fully abstract tracebased characterizations, along with a complete inequational proof system. We also
Recursive coalgebras of finitary functors
 Department of Computer Science, University of Wales Swansea
, 2005
"... Abstract For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebratoalgebra morphism into any algebra, and (iii) A is parametrically recurs ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebratoalgebra morphism into any algebra, and (iii) A is parametrically
Finitary Observations in Regular Algebras
 Proc. 27th Seminar on Current Trends in Theory and Practice of Informatics SOFSEM'2000, LNCS. Accessible at http://www.mimuw.edu.pl/~sl/papers
, 2000
"... We investigate regular algebras, admitting in nitary regular terms interpreted as least upper bounds of suitable approximation chains. We prove that nitary observable contexts are sucient for observational indistinguishability in a regular algebra. Moreover, assumed all observable sorts to be ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
to be essentially at, observational equivalence is also completely characterized by nitary contexts. As a corollary, methods of proving behavioural properties and observational equivalence of standard algebras can be reused in the setting of regular algebras.
Characterizing Reference Locality in the WWW
, 1996
"... As the World Wide Web (Web) is increasingly adopted as the infrastructure for largescale distributed information systems, issues of performance modeling become ever more critical. In particular, locality of reference is an important property in the performance modeling of distributed information sy ..."
Abstract

Cited by 220 (21 self)
 Add to MetaCart
of requests arriving at Web servers. We show that simple models based only on document popularity (likelihood of reference) are insufficient for capturing either temporal or spatial locality. Instead, we rely on an equivalent, but numerical, representation of a reference stream: a stack distance trace. We
Finitary S5Theories
"... Abstract. The objective of this paper is to identify a class of epistemic logic theories with group knowledge operators which have the fundamental property of being characterized by a finite number of finite models (up to equivalence). We specifically focus on S5theories. We call this class of epis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The objective of this paper is to identify a class of epistemic logic theories with group knowledge operators which have the fundamental property of being characterized by a finite number of finite models (up to equivalence). We specifically focus on S5theories. We call this class
The Concept of a Supercompiler
 ACM Transactions on Programming Languages and Systems
, 1986
"... A supercompiler is a program transformer of a certain type. It traces the possible generalized histories of computation by the original program, and compiles an equivalent program, reducing in the process the redundancy that could be present in the original program. The nature of the redundancy that ..."
Abstract

Cited by 194 (3 self)
 Add to MetaCart
A supercompiler is a program transformer of a certain type. It traces the possible generalized histories of computation by the original program, and compiles an equivalent program, reducing in the process the redundancy that could be present in the original program. The nature of the redundancy
Results 1  10
of
1,791