534 search results - page 74 / 107 » Proving Termination of Rewrite Systems Using Bounds |
RTA
2005
Springer
14 years 2 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
IWSOS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we have investigated the feasibility of a selforganized evacuation process when compared with a centralized control. The evacuation strategy is based on â€...
FSEN
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
ATVA
2005
Springer
14 years 2 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
IPL
2010
13 years 7 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...