Sciweavers

656 search results - page 1 / 132
» A Formalization of Transition P Systems
Sort
View
FUIN
2002
88views more  FUIN 2002»
13 years 11 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...
JLP
2010
155views more  JLP 2010»
13 years 6 months ago
Compositional semantics of spiking neural P systems
The aim of the paper is to give a formal compositional semantics for Spiking Neural P systems (SNP systems) by following the Structural Operational Semantics (SOS) approach. A pro...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
FSTTCS
2007
Springer
14 years 5 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
FUIN
2008
94views more  FUIN 2008»
13 years 11 months ago
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
Marc Boyer, Olivier H. Roux