114 search results - page 2 / 23 » Symbolic computation of differential equivalences |
CCS
2008
ACM
13 years 6 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
GC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Behavioural equivalences on open systems are usually defined by comparing system behaviour in all environments. Due to this “universal” quantification over the poss...
CAV
1993
Springer
13 years 8 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
ICRA
2006
IEEE
13 years 10 months ago
2006
IEEE
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...