Sciweavers

656 search results - page 20 / 132
» A Formalization of Transition P Systems
Sort
View
ESORICS
2010
Springer
15 years 7 months ago
Verifying Security Property of Peer-to-Peer Systems Using CSP
Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security issues. In this paper, we focus on a specific security property, called the root authenticit...
Tien Tuan Anh Dinh, Mark Ryan
BIOSYSTEMS
2008
130views more  BIOSYSTEMS 2008»
15 years 6 months ago
Biological networks in metabolic P systems
The metabolic P algorithm is a procedure which determines, in a biochemically realistic way, the evolution of P systems representing biological phenomena. A new formulation of thi...
Vincenzo Manca, Luca Bianco
REX
1993
15 years 10 months ago
Relationships Between Models of Concurrency
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
Mogens Nielsen, Vladimiro Sassone, Glynn Winskel
CMSB
2006
Springer
15 years 9 months ago
Compositional Reachability Analysis of Genetic Networks
Genetic regulatory networks have been modeled as discrete transition systems by many approaches, benefiting from a large number of formal verification algorithms available for the ...
Gregor Gößler
ENTCS
2006
150views more  ENTCS 2006»
15 years 6 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota