Results 1 
5 of
5
Reachability in Petri Nets with Inhibitor arcs
, 2004
"... We define 2 operators on relations over natural numbers such that they generalize the operators '+' and '*' and show that the membership and emptiness problem of relations constructed from finite relations with these operators and is decidable. This generalizes Presburger arith ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
(Show Context)
We define 2 operators on relations over natural numbers such that they generalize the operators '+' and '*' and show that the membership and emptiness problem of relations constructed from finite relations with these operators and is decidable. This generalizes Presburger arithmetics and allows to decide the reachability problem for those Petri nets where inhibitor arcs occur only in some restricted way. Especially the reachability problem is decidable for Petri nets with only one inhibitor arc, which solves an open problem in [KLM89] . Furthermore we describe the corresponding automaton having a decidable emptiness problem. 1
Extended Spiking Neural P Systems Generating Strings and Vectors of NonNegative Integers
 Rozenberg (eds), Preproceedings of the 7th Workshop on Membrane Computing WMC7, 2006
, 2007
"... Abstract. We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy proofs of the computational completeness of extended spiking neural P systems and for the characterization of semilinear sets and regular languages by finite extende ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy proofs of the computational completeness of extended spiking neural P systems and for the characterization of semilinear sets and regular languages by finite extended spiking neural P systems (defined by having only finite sets of rules assigned to the cells) with only a bounded number of neurons. 1
Extended Spiking Neural P Systems . . .
 ACMC/FCT 2007 WORKSHOP
, 2007
"... We consider extended variants of spiking neural P systems with decaying spikes (i.e., the spikes have a limited lifetime) and/or total spiking (i.e., the whole contents of a neuron is erased when it spikes). Although we use the extended model of spiking neural P systems, these restrictions of decayi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We consider extended variants of spiking neural P systems with decaying spikes (i.e., the spikes have a limited lifetime) and/or total spiking (i.e., the whole contents of a neuron is erased when it spikes). Although we use the extended model of spiking neural P systems, these restrictions of decaying spikes and/or total spiking do not allow for the generation or the acceptance of more than regular sets of natural numbers.
Transformation of Formal Models Transformation of Formal Models
"... Abstract In this work, we declare the focus of our dissertation thesis by presenting the main topic, declare specific focus and goals, describe viable types of transformations, and give the current state of the art. A brief summary of the obtained results is given. We argue that the achieved result ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract In this work, we declare the focus of our dissertation thesis by presenting the main topic, declare specific focus and goals, describe viable types of transformations, and give the current state of the art. A brief summary of the obtained results is given. We argue that the achieved results are important both from a theoretical and practical viewpoint.
THE POWER OF PROGRAMMED GRAMMARS WITH GRAPHS FROM VARIOUS CLASSES
"... Abstract. Programmed grammars, one of the most important and well investigated classes of grammars with contextfree rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the ge ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Programmed grammars, one of the most important and well investigated classes of grammars with contextfree rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pruniversal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages. AMS Mathematics Subject Classification: 68Q45 Key words and phrases: Programmed grammars and languages, graph controlled grammars and languages 1.