240 search results - page 9 / 48 » Infinite trace equivalence |
ICMAS
2000
14 years 10 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
FM
1994
Springer
15 years 1 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
SIAMCO
2010
14 years 4 months ago
2010
We study the optimal input-output stabilization of discrete time-invariant linear systems in Hilbert spaces by output injection. We show that a necessary and sufficient condition ...
TSP
2010
14 years 4 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...