Sciweavers

946 search results - page 115 / 190
» Process Algebra and Non-Interference
Sort
View
UC
2005
Springer
14 years 2 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm
CSFW
2003
IEEE
14 years 2 months ago
Automatic Validation of Protocol Narration
We perform a systematic expansion of protocol narrations into terms of a process algebra in order to make precise some of the detailed checks that need to be made in a protocol. W...
Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, ...
ICALP
2003
Springer
14 years 2 months ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
ISSAC
2001
Springer
129views Mathematics» more  ISSAC 2001»
14 years 1 months ago
Computation of the degree of rational maps between curves
The degree of a rational map measures how often the map covers the image variety. In particular, when the rational map is a parametrization, the degree measures how often the para...
J. Rafael Sendra, Franz Winkler
CONCUR
1997
Springer
14 years 28 days ago
Bounded Stacks, Bags and Queues
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
Jos C. M. Baeten, Jan A. Bergstra