12 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.LO2016
Liveness of Parameterized Timed Networks
Benjamin Aminof, Sasha Rubin, Francesco Spegni +1
We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks. We show that this problem is decid…
cs.LO2014
Satisfiability and Model Checking of CTL* with Graded Path Modalities
Benjamin Aminof, Aniello Murano, Sasha Rubin
Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called…
cs.LO2014★ 12 cited
First Cycle Games
Benjamin Aminof, Sasha Rubin
First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determi…