656 search results - page 20 / 132 » A Formalization of Transition P Systems |
80
Voted
ESORICS
2010
Springer
14 years 10 months ago
2010
Springer
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...
83
Voted
BIOSYSTEMS
2008
14 years 9 months ago
2008
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...
75
Voted
REX
1993
15 years 1 months ago
1993
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
82
Voted
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
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 ...
ENTCS
2006
14 years 9 months ago
2006
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...