22 search results - page 1 / 5 » A Ground-Complete Axiomatization of Finite State Processes i... |
CONCUR
2005
Springer
13 years 6 months ago
2005
Springer
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
TSP
2010
12 years 11 months ago
2010
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...