References of "Information and Computation"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailBisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol
Belardinelli, Francesco; Condurache, Rodica; Dima, Catalin et al

in Information and Computation (2021), 276

We propose a notion of alternating bisimulation for strategic abilities under imperfect information. The bisimulation preserves formulas of ATL$^*$ for both the {\em objective} and {\em subjective ... [more ▼]

We propose a notion of alternating bisimulation for strategic abilities under imperfect information. The bisimulation preserves formulas of ATL$^*$ for both the {\em objective} and {\em subjective} variants of the state-based semantics with imperfect information, which are commonly used in the modeling and verification of multi-agent systems. Furthermore, we apply the theoretical result to the verification of coercion-resistance in the ThreeBallot voting system, a voting protocol that does not use cryptography. In particular, we show that natural simplifications of an initial model of the protocol are in fact bisimulations of the original model, and therefore satisfy the same ATL$^*$ properties, including coercion-resistance. These simplifications allow the model-checking tool MCMAS to terminate on models with a larger number of voters and candidates, compared with the initial model. [less ▲]

Detailed reference viewed: 57 (12 UL)
Full Text
Peer Reviewed
See detailReactive automata
Crochemore, Maxime; Gabbay, Dov M. UL

in Information and Computation (2011), 209(4), 692704

A reactive automaton has extra links whose role is to change the behaviour of the automaton. We show that these links do not increase the expressiveness of finite automata but that they can be used to ... [more ▼]

A reactive automaton has extra links whose role is to change the behaviour of the automaton. We show that these links do not increase the expressiveness of finite automata but that they can be used to reduce dramatically their state number both in the deterministic case and the non-deterministic case. Typical examples of regular expressions associated with deterministic automata of ex- ponential size according to the length of the expression show that reactive links provide an alternative representation of total linear size for the language [less ▲]

Detailed reference viewed: 60 (1 UL)
Full Text
Peer Reviewed
See detailA framework for compositional verification of security protocols
Andova, S.; Cremers, C. J. F.; Gjøsteen, K. et al

in Information and Computation (2008), 206(2-4), 425-459

Detailed reference viewed: 99 (1 UL)