Sciweavers

258 search results - page 10 / 52
» Weak Bisimulation Approximants
Sort
View
FOSSACS
2007
Springer
15 years 3 months ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala
MOC
2011
14 years 4 months ago
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...
LICS
1999
IEEE
15 years 1 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 4 months ago
Using computer games for hybrid systems controller synthesis
Abstract-- We propose a formal method for feedback controller synthesis using interactive computer programs with graphical interface (in short, computer games). The main theoretica...
A. Agung Julius, Sina Afshari
LICS
2000
IEEE
15 years 1 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
Alan Jeffrey, Julian Rathke