Sciweavers

1195 search results - page 118 / 239
» Modeling an Algebraic Stepper
Sort
View
ICASSP
2009
IEEE
15 years 10 months ago
Joint estimation of short-term and long-term predictors in speech coders
In low bit-rate coders, the near-sample and far-sample redundancies of the speech signal are usually removed by a cascade of a shortterm and a long-term linear predictor. These tw...
Daniele Giacobello, Mads Græsbøll Chr...
ETRICS
2006
15 years 10 months ago
Possibilistic Information Flow Control in MAKS and Action Refinement
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
Dieter Hutter
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 10 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
PARLE
1987
15 years 9 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
IADIS
2004
15 years 7 months ago
A CSP based ontology for a smart home
This paper addresses the problem of establishing collaboration between devices in a home environment, even when no previous knowledge is known or stored on the devices. It focuses...
José Ignacio Rendo Fernández, Iain W...