invariant analysis
Recently Published Documents


TOTAL DOCUMENTS

110
(FIVE YEARS 21)

H-INDEX

17
(FIVE YEARS 2)

2021 ◽  
Vol 33 (12) ◽  
pp. 121707
Author(s):  
Cruz Y. Li ◽  
Zengshun Chen ◽  
Tim K. T. Tse ◽  
Asiri Umenga Weerasuriya ◽  
Xuelin Zhang ◽  
...  

2021 ◽  
pp. 197-214
Author(s):  
Ann Whittle

In this chapter, a significant objection to contextualist theories of moral responsibility is examined, ‘the problem of unfairness’. After outlining the problem, reasons are offered to support the claim that moving to an invariant analysis of moral responsibility is unwarranted. It is argued that there is good reason, independent of contextualism, to divorce the concept of moral responsibility from that of blame, when the latter is construed as entailing harmful treatment of others. Even if this is denied, however, inter-agential judgements of moral responsibility can still be rendered fair. Consequently, a contextualist theory of moral responsibility can be retained whilst avoiding the problem of unfairness. This undercuts a significant motivation for endorsing an amelioration of our concept of moral responsibility, in either the direction of invariant compatibilism or that of invariant incompatibilism.


2021 ◽  
Vol 150 ◽  
pp. 111151
Author(s):  
Vikas Kumar ◽  
Anjan Biswas ◽  
Mehmet Ekici ◽  
Luminita Moraru ◽  
Abdullah Khamis Alzahrani ◽  
...  

2021 ◽  
Vol 11 (13) ◽  
pp. 5877
Author(s):  
José M. Amigó ◽  
Guillem Duran ◽  
Ángel Giménez ◽  
José Valero ◽  
Oscar Martinez Bonastre

Formal modeling is considered one of the fundamental phases in the design of network algorithms, including Active Queue Management (AQM) schemes. This article focuses on modeling with Petri nets (PNs) a new scheme of AQM. This innovative AQM is based on a discrete dynamical model of random early detection (RED) for controlling bifurcations and chaos in Internet congestion control. It incorporates new parameters (α,β) that make possible better stability control over oscillations of an average queue length (AQL) at the router. The PN is validated through the matrix equation approach, reachability tree, and invariant analysis. The correctness is validated through the key properties of reachability, boundedness, reversibility, deadlock, and liveness.


Sign in / Sign up

Export Citation Format

Share Document