Sciweavers

366 search results - page 13 / 74
» Four equivalent equivalences of reductions
Sort
View
ENTCS
2007
137views more  ENTCS 2007»
13 years 7 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
FORMATS
2010
Springer
13 years 5 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan
HYBRID
2004
Springer
14 years 24 days ago
Bisimulation of Dynamical Systems
A general notion of bisimulation is studied for dynamical systems. An algebraic characterization of bisimulation together with an algorithm for computing the maximal bisimulation r...
A. J. van der Schaft
ICALP
2004
Springer
14 years 24 days ago
A Calculus of Coroutines
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
James Laird
ASIACRYPT
2003
Springer
14 years 19 days ago
Some RSA-Based Encryption Schemes with Tight Security Reduction
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encr...
Kaoru Kurosawa, Tsuyoshi Takagi