22 search results - page 2 / 5 » A Tool Set for deciding Behavioral Equivalences |
CAV
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
116
click to vote
PACT
2005
Springer
15 years 5 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
110
click to vote
JAPLL
2006
14 years 11 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
127
click to vote
CORR
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
113
click to vote
ECOOP
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. This paper presents a framework of specification and verification for distributed real-time object-oriented systems. An earlier paper [17] introduced a process calculus...