30 search results - page 4 / 6 » fsttcs 2005 |
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a ty...