Sciweavers

JALC
2006
95views more  JALC 2006»
13 years 11 months ago
On the Decidability of Model-Checking for P Systems
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
JALC
2006
125views more  JALC 2006»
13 years 11 months ago
A Confinement Criterion for Securely Executing Mobile Code
Mobile programs, like applets, are not only ubiquitous, but also potentially malicious. We study the case where mobile programs are executed by a host system in a secured environm...
Hervé Grall
JALC
2006
133views more  JALC 2006»
13 years 11 months ago
Power and Efficiency of Minimal Parallelism in Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
Tseren-Onolt Ishdorj
JALC
2006
90views more  JALC 2006»
13 years 11 months ago
Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
Peter R. J. Asveld
JALC
2006
87views more  JALC 2006»
13 years 11 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...
JALC
2006
143views more  JALC 2006»
13 years 11 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...
JALC
2006
61views more  JALC 2006»
13 years 11 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
JALC
2006
81views more  JALC 2006»
13 years 11 months ago
A Monoidal Interval of Clones of Selfdual Functions
Let A be a 2p-element set, p prime, and let be a fixed point-free permutation on A of order p. We study the interval of clones C on A such that C consists of functions that are s...
Andrei A. Krokhin, Ivo G. Rosenberg