scholarly journals On Inductive Verification and Synthesis

10.29007/9199 ◽  
2019 ◽  
Author(s):  
Dennis Peuter ◽  
Viorica Sofronie-Stokkermans

We study possibilities of using symbol elimination in program verification and synthesis. We consider programs for which a property is given, which is supposed to hold for all states reachable from the initial states. If it can not be proven that such a formula is an inductive invariant, the task is to find conditions to strengthen the property in order to make it an inductive invariant. We propose a method for property-directed invariant generation and analyze its properties.

2005 ◽  
Vol 5 (3) ◽  
pp. 223-241
Author(s):  
A. Carpio ◽  
G. Duro

AbstractUnstable growth phenomena in spatially discrete wave equations are studied. We characterize sets of initial states leading to instability and collapse and obtain analytical predictions for the blow-up time. The theoretical predictions are con- trasted with the numerical solutions computed by a variety of schemes. The behavior of the systems in the continuum limit and the impact of discreteness and friction are discussed.


Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1443
Author(s):  
Zhiyuan Dong ◽  
Ai-Guo Wu

In this paper, we extend the quantum game theory of Prisoner’s Dilemma to the N-player case. The final state of quantum game theory of N-player Prisoner’s Dilemma is derived, which can be used to investigate the payoff of each player. As demonstration, two cases (2-player and 3-player) are studied to illustrate the superiority of quantum strategy in the game theory. Specifically, the non-unique entanglement parameter is found to maximize the total payoff, which oscillates periodically. Finally, the optimal strategic set is proved to depend on the selection of initial states.


2020 ◽  
Vol 2 (3) ◽  
Author(s):  
Peter D. Drummond ◽  
Bogdan Opanchuk

2009 ◽  
Vol 44 (6) ◽  
pp. 223-234 ◽  
Author(s):  
Saurabh Srivastava ◽  
Sumit Gulwani

Sign in / Sign up

Export Citation Format

Share Document