366 search results - page 14 / 74 » Four equivalent equivalences of reductions |
ENTCS
2007
15 years 19 days 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...
126
Voted
LICS
1997
IEEE
15 years 4 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 ...
97
Voted
COMPUTING
2006
15 years 22 days 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...
114
Voted
CONCUR
2008
Springer
15 years 2 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...
136
click to vote
ICALP
2011
Springer
14 years 4 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 ...