4036 search results - page 223 / 808 » Formal Methods |
185
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...
161
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
165
click to vote
FMCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we shall survey and discuss in detail the work on the relative expressiveness of recursion and replication in various process calculi. Namely, CCS, the -calculus, the...
167
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
185
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...