486 search results - page 1 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
CAV
1994
Springer
13 years 9 months ago
1994
Springer
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
TPDS
1998
13 years 4 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
CAV
2008
Springer
13 years 7 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
CONCUR
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
ICPP
1995
IEEE
13 years 8 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...