Sciweavers

12115 search results - page 24 / 2423
» Bisimulation of Dynamical Systems
Sort
View
CONCUR
1999
Springer
14 years 1 months ago
Statecharts Via Process Algebra
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends nite-state machines with concepts of hierarchy, concurrency, and priority. De...
Gerald Lüttgen, Michael von der Beeck, Rance ...
FOSSACS
2008
Springer
13 years 10 months ago
Symbolic Semantics Revisited
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
Filippo Bonchi, Ugo Montanari
FM
2001
Springer
138views Formal Methods» more  FM 2001»
14 years 1 months ago
An Adequate Logic for Full LOTOS
We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition sys...
Muffy Calder, Savi Maharaj, Carron Shankland
MSCS
2010
84views more  MSCS 2010»
13 years 7 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi
CONCUR
2009
Springer
14 years 3 months ago
Computing Stuttering Simulations
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preord...
Francesco Ranzato, Francesco Tapparo