About primitive recursive algorithms

1989 ◽  
pp. 194-206 ◽  
Author(s):  
Loïc Colson
Keyword(s):  
Recursive Algorithms ◽  
Primitive Recursive

A Representation Theorem for Primitive Recursive Algorithms

2011 ◽  
Vol 107 (4) ◽  
pp. 313-330 ◽  
Author(s):  
Philippe Andary ◽  
Bruno Patrou ◽  
Pierre Valarcher
Keyword(s):  
Representation Theorem ◽  
Recursive Algorithms ◽  
Primitive Recursive

scholarly journals About primitive recursive algorithms

1991 ◽  
Vol 83 (1) ◽  
pp. 57-69 ◽  
Author(s):  
Loïc Colson
Keyword(s):  
Recursive Algorithms ◽  
Primitive Recursive

scholarly journals Coverability, Termination, and Finiteness in Recursive Petri Nets

2022 ◽  
Vol 183 (1-2) ◽  
pp. 33-66
Author(s):  
Alain Finkel ◽  
Serge Haddad ◽  
Igor Khmelnitsky
Keyword(s):  
Petri Nets ◽  
Point Of View ◽  
Recursive Algorithms ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Extended Petri Nets ◽  
Multi Agent ◽  
Almost All ◽  
Primitive Recursive ◽  
Context Free

In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets and context-free grammars, most of the usual problems (reachability, coverability, finiteness, boundedness and termination) were known to be solvable by using non-primitive recursive algorithms. For almost all other extended Petri nets models containing a stack, the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In contrast, we establish here that for Recursive Petri nets, the coverability, termination, boundedness and finiteness problems are EXPSPACE-complete as for Petri nets. From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get a more powerful model than Petri net for free.

scholarly journals Towards efficient verification of population protocols

2021 ◽  
Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer
Keyword(s):  
Linear Constraints ◽  
Computational Power ◽  
High Complexity ◽  
Reachability Problem ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Efficient Verification ◽  
Primitive Recursive ◽  
Very High

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.

scholarly journals Recursive algorithms for the computation of the potential harmonic coefficients of a constant density polyhedron

2009 ◽  
Vol 83 (10) ◽  
pp. 925-942 ◽  
Author(s):  
Dimitrios Tsoulis ◽  
Olivier Jamet ◽  
Jérôme Verdun ◽  
Nicolas Gonindard
Keyword(s):  
Constant Density ◽  
Recursive Algorithms ◽  
Potential Harmonic
Sign in / Sign up

Export Citation Format

Share Document