749 search results - page 1 / 150 » Combinatory Models and Symbolic Computation |
DISCO
1992
13 years 9 months ago
1992
We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of alge...
CHARME
2001
Springer
13 years 8 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
GLVLSI
2000
IEEE
13 years 9 months ago
2000
IEEE
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
APN
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...