Sciweavers

6978 search results - page 170 / 1396
» On Proofs in System P
Sort
View
JALC
2006
95views more  JALC 2006»
15 years 6 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
COCOON
2005
Springer
16 years 1 days ago
On Sequential and 1-Deterministic P Systems
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...
FROCOS
2007
Springer
15 years 10 months ago
Certification of Automated Termination Proofs
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
Evelyne Contejean, Pierre Courtieu, Julien Forest,...
MCU
2007
90views Hardware» more  MCU 2007»
15 years 8 months ago
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
Abstract. We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable...
Artiom Alhazov, Rudolf Freund, Marion Oswald, Serg...
FUIN
2002
88views more  FUIN 2002»
15 years 6 months ago
A Formalization of Transition P Systems
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
Mario J. Pérez-Jiménez, Fernando San...