Sciweavers

2465 search results - page 183 / 493
» Automata on Linear Orderings
Sort
View
ISTA
2003
13 years 11 months ago
Formal Modeling of Communication Traces
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
Sergiy Boroday, Hesham Hallal, Alexandre Petrenko,...
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 10 months ago
Simulation vs. Equivalence
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
Zoltán Ésik, Andreas Maletti
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 10 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
ENTCS
2007
97views more  ENTCS 2007»
13 years 10 months ago
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
Harald Fecher, Heiko Schmidt
TCS
2008
13 years 10 months ago
Decidability and syntactic control of interference
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
James Laird