Hide and New in the Pi-Calculus

Autor: Marco Giunti, Frank D. Valencia, Catuscia Palamidessi

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 89, Iss Proc. EXPRESS/SOS 2012, Pp 65-79 (2012)

In this paper, we enrich the pi-calculus with an operator for confidentiality (hide), whose main effect is to restrict the access to the object of the communication, thus representing confidentiality in a natural way. The hide operator is meant for l

Externí odkaz: https://doaj.org/article/f0867b719722470986505aeb5c69bdb6

A Multi-agent Model for Polarization Under Confirmation Bias in Social Networks

Autor: Sophia Knight, Bernardo Nascimento de Amorim, Santiago Quintero, Mário S. Alvim, Frank D. Valencia

Publikováno v: FORTE 2021-41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems
FORTE 2021-41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Jun 2021, Valletta, Malta
Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783030780883
FORTE
HAL

We describe a model for polarization in multi-agent systems based on Esteban and Ray's standard measure of polarization from economics. Agents evolve by updating their beliefs (opinions) based on an underlying influence graph, as in the standard DeGr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa335ced96f06556269f7e834bd75402
https://hal.archives-ouvertes.fr/hal-03095987

Reasoning about distributed information with infinitely many agents

Autor: Santiago Quintero, Camilo Rueda, Michell Guzmán, Frank D. Valencia, Sergio Ramírez, Sophia Knight

Publikováno v: Journal of Logical and Algebraic Methods in Programming. 121:100674

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups. We characte

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::330cca12bc0d4797077e12fadf5871e6
https://doi.org/10.1016/j.jlamp.2021.100674

Make Puzzles Great Again

Autor: Frank D. Valencia, Nicolás Aristizabal, Camilo Rueda, Carlos Pinzón

Publikováno v: The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy-Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday
Mário S. Alvim; Konstantinos Chatzikokolakis; Carlos Olarte; Frank Valencia. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy-Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, 11760, Springer, pp.442-459, 2019, Lecture Notes in Computer Science, 978-3-030-31174-2. ⟨10.1007/978-3-030-31175-9_25⟩
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy ISBN: 9783030311742
The Art of Modelling Computational Systems

International audience; We present original solutions to four challenging mathematical puzzles. The first two are concerned with random processes. The first, here called The President's Welfare Plan, can be reduced to computing, for arbitrary large v

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be87c3510a280d849bbe4ff8e85e86cf
https://hal.archives-ouvertes.fr/hal-02410767

Characterizing Right Inverses for Spatial Constraint Systems with Applications to Modal Logic

Autor: Camilo Rueda, Frank D. Valencia, Salim Perchy, Michell Guzmán

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 744 (56--77)
Theoretical Computer Science, 2018, 744 (56--77)

International audience; Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. In this paper spatial constraint systems are used to give an abstract

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af80ef9aa6c7fb7f782a4f28afe3bb11
https://hal.inria.fr/hal-01675010v2/document