366 search results - page 14 / 74 » Four equivalent equivalences of reductions |
ENTCS
2007
13 years 7 months ago
2007
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a f...
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
COMPUTING
2006
13 years 7 months ago
2006
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We present a new labelled transition system (lts) for the ambient calculus on which ordinary bisimilarity coincides with contextual equivalence. The key feature of this lts is that...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...