Magnus Find,Mika Göös,Matti Järvisalo et al.
Magnus Find et al.
Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative ...
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip [0.03%]
严格的自稳故障容错电路建模：系统芯片中的超稳健时钟方案
Danny Dolev,Matthias Függer,Markus Posch et al.
Danny Dolev et al.
We present the first implementation of a distributed clock generation scheme for Systems-on-Chip that recovers from an unbounded number of arbitrary transient faults despite a large number of arbitrary permanent faults. We devise self-stabi...
Strategy improvement for concurrent reachability and turn-based stochastic safety games [0.03%]
并发可达性和基于回合的随机安全博弈中的策略优化方法
Krishnendu Chatterjee,Luca de Alfaro,Thomas A Henzinger
Krishnendu Chatterjee
We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objec...