Sciweavers

70 search results - page 9 / 14
» Some properties of the regular asynchronous systems
Sort
View
LATA
2010
Springer
13 years 11 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
BIBE
2008
IEEE
102views Bioinformatics» more  BIBE 2008»
14 years 1 months ago
Motifs in regulatory networks and their structural robustness
: If we consider the regulatory networks used in systems biology (especially in neural and genetic networks), we observe certain regularities in their architecture, namely the occu...
Adrien Elena, Hedi Ben Amor, N. Glade, Jacques Dem...
LICS
1993
IEEE
13 years 11 months ago
Verifying Programs with Unreliable Channels
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
Parosh Aziz Abdulla, Bengt Jonsson
FORTE
2003
13 years 8 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
FMSD
2006
83views more  FMSD 2006»
13 years 7 months ago
A Framework for Modeling the Distributed Deployment of Synchronous Designs
Synchronous specifications are appealing in the design of large scale hardware and software systems because of their properties that facilitate verification and synthesis. When the...
Luca P. Carloni, Alberto L. Sangiovanni-Vincentell...