Sciweavers

195 search results - page 12 / 39
» Process Algebra with Nonstandard Timing
Sort
View
SIGMETRICS
2010
ACM
122views Hardware» more  SIGMETRICS 2010»
14 years 7 months ago
Heavy-traffic limits for nearly deterministic queues
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...
Karl Sigman, Ward Whitt
TCOS
2008
14 years 9 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang
75
Voted
JLP
2006
113views more  JLP 2006»
14 years 9 months ago
Continuity controlled hybrid automata
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...
Jan A. Bergstra, C. A. Middelburg
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 1 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
FUIN
2008
93views more  FUIN 2008»
14 years 9 months ago
An Algebraic Framework for Defining Random Concurrent Behaviours
Abstract. The paper is devoted to characterizing systems with random behaviours. The characterization is based on considering systems in terms of their possible runs, called proces...
Józef Winkowski