Sciweavers

644 search results - page 120 / 129
» Precedence Automata and Languages
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
COORDINATION
2007
Springer
14 years 2 months ago
Component Connectors with QoS Guarantees
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
Farhad Arbab, Tom Chothia, Sun Meng, Young-Joo Moo...
FOSSACS
2007
Springer
14 years 2 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
ACSD
2005
IEEE
71views Hardware» more  ACSD 2005»
14 years 2 months ago
Two-Phase Distributed Observation Problems
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
Stavros Tripakis
IDEAS
2005
IEEE
113views Database» more  IDEAS 2005»
14 years 2 months ago
On the Intersection of XPath Expressions
— XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the la...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...