Search

Your search keyword '"Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group)"' showing total 24 results
Start Over Author "Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group)"
24 results on '"Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group)"'

1. Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge

Author

Pinzón, Carlos, Quintero, Santiago, Ramírez, Sergio, Valencia, Frank, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Pontificia universidad Javeriana, Cali, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Lattice Algorithms, Distributive Knowledge, [INFO]Computer Science [cs], Join-endomorphims
Abstract

International audience; Let L be a distributive lattice and E(L) be the set of join endomorphisms of L. We consider the problem of finding f E(L) g given L and f, g ∈ E(L) as inputs. (1) We show that it can be solved in time O(n) where n = |L|. The previous upper bound was O(n^2). (2) We characterize the standard notion of distributed knowledge of a group as the greatest lower bound of the joinendomorphisms representing the knowledge of each member of the group. (3) We show that deciding whether an agent has the distributed knowledge of two other agents can be computed in time O(n^2) where n is the size of the underlying set of states. (4) For the special case of S5 knowledge, we show that it can be decided in time O(nα_n) where α_n is the inverse of the Ackermann function.

Published
2021

2. 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

Author

Mário S. Alvim, Frank D. Valencia, Carlos Olarte, Konstantinos Chatzikokolakis, Computer Science Department [Belo Horizonte] (DCC), Universidade Federal de Minas Gerais, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), National and Kapodistrian University of Athens (NKUA), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Universidade Federal do Rio Grande do Norte [Natal] (UFRN), Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank Valencia, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Theoretical computer science, Unification, Logic Programming, Computer science, Semantics (computer science), Concurrency Theory, Concurrency, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Epistemic modal logic, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Logic programming, Bisimulation, Probabilistic logic, 020207 software engineering, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Privacy, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Security, Computer Science::Programming Languages, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again.

Published
2019

3. Make Puzzles Great Again

Author

Frank D. Valencia, Nicolás Aristizabal, Camilo Rueda, Carlos Pinzón, Pontificia universidad Javeriana, Cali, Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), ECOS-NORD project FACTS (C19M03) and the Colciencias project CLASSIC (125171250031)., Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank Valencia, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
[INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Computer science, Group (mathematics), Stochastic process, hat problems, 0102 computer and information sciences, Expected value, Mathematical puzzle, Discount points, Random walk, 01 natural sciences, mathematical puzzles, Recreational mathematics, 010104 statistics & probability, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], 010201 computation theory & mathematics, recreational mathematics, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 0101 mathematics, Mathematical economics, Variable (mathematics)
Abstract

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 values of n, the expected number of iterations of a program that increases a variable at random between 1 and n until exceeds n. The second one, called The Dining Researchers, can be reduced to determining the probability of reaching a given point after visiting all the others in a circular random walk. The other two problems, called Students vs Professor and Students vs Professor II, involve finding optimal winning group strategies in guessing games.

Published
2019

4. Reasoning about Distributed Knowledge of Groups with Infinitely Many Agents

Author

Guzmán, Michell, Knight, Sophia, Quintero, Santiago, Ramírez, Sergio, Rueda, Camilo, Valencia, Frank, Università degli Studi di Milano-Bicocca [Milano] (UNIMIB), University of Minnesota [Duluth], University of Minnesota System, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Pontificia universidad Javeriana, Cali, Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), FACTS: Foundational Approach to Cognition in Today’s Societ (C19M03) - ECOS-NORD France - Colombie (2018) - Université Paris 13Project CLASSIC (125171250031) - Colciencias, Wan Fokkink, Rob van Glabbeek, Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
000 Computer science, knowledge, general works, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Reasoning about Group, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, Spatial Information, Infinitely Many Agents, 010201 computation theory & mathematics, Distributed Knowledge, Computer Science, Algebraic Modeling, Reasoning about Space, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

International audience; 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 characterize the notion of distributed information of a group of agents as the infimum of the set of join-preserving functions that represent the spaces of the agents in the group. We provide an alternative characterization of this notion as the greatest family of join-preserving functions that satisfy certain basic properties. We show compositionality results for these characterizations and conditions under which information that can be obtained by an infinite group can also also be obtained by a finite group. Finally, we provide algorithms that compute the distributive group information of finite groups.

Published
2019

5. Semantic Structures for Spatially-Distributed Multi-Agent Systems

Author

Frank D. Valencia, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Process calculus, 0102 computer and information sciences, 02 engineering and technology, Semantics, 01 natural sciences, lcsh:QA75.5-76.95, F.4.3, D.3.2, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Multiagent Systems, Group (mathematics), Multi-agent system, lcsh:Mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, lcsh:QA1-939, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Logic in Computer Science (cs.LO), Computer Science::Other, Constraint (information theory), Modal, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computer Science - Distributed, Parallel, and Cluster Computing, 010201 computation theory & mathematics, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Computer Science::Programming Languages, lcsh:Electronic computers. Computer science, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Multiagent Systems (cs.MA)
Abstract

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. They have been used to reason about beliefs, lies, and group epistemic behaviour inspired by social networks. They have also been used for proving new results about modal logics and giving semantics to process calculi. In this paper we will discuss the theory and main results about scs., In Proceedings EXPRESS/SOS 2019, arXiv:1908.08213. This is an invited contribution to EXPRESS/SOS 2019 based on my invited talk

Published
2019

6. Models and emerging trends of concurrent constraint programming

Author

Camilo Rueda, Frank D. Valencia, Carlos Olarte, Departamento de Electrónica, Pontificia Universidad Javeriana, Pontificia Universidad Javeriana (PUJ), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Concurrent constraint logic programming, Theoretical computer science, Computer science, Concurrency, Distributed computing, Cloud computing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Discrete Mathematics and Combinatorics, Reactive system, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], business.industry, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Constraint satisfaction, Variety (cybernetics), Concurrent object-oriented programming, Computational Theory and Mathematics, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Concurrent Constraint Programming, business, Software
Abstract

International audience; Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a vast variety of systems as those arising in biological phenomena, reactive systems, net- centric computing and the advent of social networks and cloud computing. In this paper we survey the main applications, developments and current trends of CCP.

Published
2013

7. Deriving Inverse Operators for Modal Logic

Author

Michell Guzmán, Camilo Rueda, Frank D. Valencia, Salim Perchy, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Pontificia universidad Javeriana, Cali, Colciencias project 125171250031 CLASSIC, Augusto Sampaio, Farn Wang, ANR-12-IS02-0001,PACE,Processus non-standard: Analyse, Coinduction, Expressivité(2012), ANR-11-LABX-0045,DIGICOSME,Mondes numériques: Données, programmes et architectures distribués(2011), ANR-11-IDEX-0003,IPS,Idex Paris-Saclay(2011), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, constraint systems, Normal modal logic, order theory, 0102 computer and information sciences, 02 engineering and technology, Modal operator, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], kripke structures, 01 natural sciences, Linear temporal logic, modal algebra, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Accessibility relation, Mathematics, modal logic, Discrete mathematics, inverse operators, Multimodal logic, Modal μ-calculus, Modal logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, 16. Peace & justice, ACM: H.: Information Systems/H.1: MODELS AND PRINCIPLES, Algebra, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], 010201 computation theory & mathematics, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], bisimulation, Dynamic logic (modal logic), Computer Science::Programming Languages
Abstract

International audience; Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. We shall use spatial constraint systems to give an abstract characterization of the notion of normality in modal logic and to derive right inverse/reverse operators for modal languages. In particular, we shall identify the weakest condition for the existence of right inverses and show that the abstract notion of normality corresponds to the preservation of finite suprema. We shall apply our results to existing modal languages such as the weakest normal modal logic, Hennessy-Milner logic, and linear-time temporal logic. We shall discuss our results in the context of modal concepts such as bisimilarity and inconsistency invariance.

Published
2016

8. On the Expressiveness of Spatial Constraint Systems

Author

Guzmán, Michell, Valencia, Frank D., Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Pontificia universidad Javeriana, Cali, Allocation 7161, John Gallagher, Germán Vidal, Manuel Carro, Andy King, Neda Saeedloei, Marina De Vos, ANR-12-IS02-0001,PACE,Processus non-standard: Analyse, Coinduction, Expressivité(2012), ANR-11-LABX-0045,DIGICOSME,Mondes numériques: Données, programmes et architectures distribués(2011), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)

Subjects
ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Constraint systems, 000 Computer science, knowledge, general works, Modal logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, 01 natural sciences, Concurrent constraint, programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.5: Modal logic, 010201 computation theory & mathematics, Computer Science, [INFO]Computer Science [cs], Epistemic logic
Abstract

Appears as a Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016); International audience; In this paper we shall report on our progress using spatial constraint system as an abstract representation of modal and epistemic behaviour. First we shall give an introduction as well as the background to our work. Then, we present our preliminary results on the representation of modal behaviour by using spatial constraint systems. Then, we present our ongoing work on the characterization of the epistemic notion of knowledge. Finally, we discuss about the future work of our research.

Published
2016

9. An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

Author

Stefan Haar, Salim Perchy, Camilo Rueda, Frank D. Valencia, Modeling and Exploitation of Interaction and Concurrency (MEXICO), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Pontificia universidad Javeriana, Cali, Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Elvira Albert, Moreno Falaschi, ANR-12-IS02-0001,PACE,Processus non-standard: Analyse, Coinduction, Expressivité(2012), ANR-11-LABX-0045,DIGICOSME,Mondes numériques: Données, programmes et architectures distribués(2011), ANR-11-IDEX-0003,IPS,Idex Paris-Saclay(2011), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Theoretical computer science, Computer science, Process (engineering), Concurrency, Space, Space (commercial competition), [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Epistemic modal logic, [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN], Point (geometry), Mobility, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, Lies, business.industry, Extrusion, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, 16. Peace & justice, Rotation formalisms in three dimensions, Constraint (information theory), [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Social Networks, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.5: Modal logic, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Utterance
Abstract

International audience; We enrich spatial constraint systems with operators to specify information and processes moving from a space to another. We shall refer to these news structures as spatial constraint systems with extrusion. We shall investigate the properties of this new family of constraint systems and illustrate their applications. From a computational point of view the new operators provide for pro-cess/information extrusion, a central concept in formalisms for mobile communication. From an epistemic point of view extrusion corresponds to a notion we shall call utterance; a piece of information that an agent communicates to others but that may be inconsistent with the agent's beliefs. Utterances can then be used to express instances of epistemic notions, which are common place in social media, such as hoaxes or intentional lies. Spatial constraint systems with extrusion can be seen as complete Heyting algebras equipped with maps to account for spatial and epistemic specifications

Published
2015

10. Spatial and Epistemic Modalities in Constraint-Based Process Calculi

Author

Sophia Knight, Frank D. Valencia, Catuscia Palamidessi, Prakash Panangaden, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Maciej Koutny and Irek Ulidowski, ANR-09-BLAN-0169,PANDA(2009), European Project: 295261,EC:FP7:PEOPLE,FP7-PEOPLE-2011-IRSES,MEALS(2011), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Theoretical computer science, Concurrency, Process calculus, Modal Logic, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Constraint Programming, Epistemic Logic, Epistemic modal logic, Computer Science::Logic in Computer Science, Common knowledge, 0202 electrical engineering, electronic engineering, information engineering, Cloud Storage, Spatial analysis, Mathematics, business.industry, Modal logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Epistemic modality, Epistemology, Constraint (information theory), Computer Science::Multiagent Systems, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Knowledge, Social Networks, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, F.4.1, D.1.3
Abstract

International audience; We introduce spatial and epistemic process calculi for reasoning about spatial information and knowledge distributed among the agents of a system. We introduce domain-theoretical structures to represent spatial and epistemic information. We provide operational and denotational techniques for reasoning about the potentially infinite behaviour of spatial and epistemic processes. We also give compact representations of infinite objects that can be used by processes to simulate announcements of common knowledge and global information

Published
2012

11. Hide and New in the Pi-Calculus

Author

Catuscia Palamidessi, Marco Giunti, Frank D. Valencia, Centro de Investigação em Informática e Tecnologias da Informação (CITI), Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Project PTDC/EIA-CCO/117513/2010 Liveness, Statically, Bas Luttik and Michel A. Reniers, ANR-09-BLAN-0169,PANDA(2009), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)

Subjects
FOS: Computer and information sciences, Computer Science - Cryptography and Security, D.3.2, D.3.3, Computer science, Semantics (computer science), F.4, Context (language use), 0102 computer and information sciences, 02 engineering and technology, Computer security, computer.software_genre, 01 natural sciences, lcsh:QA75.5-76.95, new operator, Operator (computer programming), Pi Calculus, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Confidentiality, Bisimulation, Computer Science - Programming Languages, hiding operator, lcsh:Mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Construct (python library), lcsh:QA1-939, 010201 computation theory & mathematics, restrict, lcsh:Electronic computers. Computer science, Cryptography and Security (cs.CR), computer, Scope (computer science), Programming Languages (cs.PL)
Abstract

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 local communication, and it differs from new in that it forbids the extrusion of the name and hence has a static scope. Consequently, a communication channel in the scope of a hide can be implemented as a dedicated channel, and it is more secure than one in the scope of a new. To emphasize the difference, we introduce a spy context that represents a side-channel attack and breaks some of the standard security equations for new. To formally reason on the security guarantees provided by the hide construct, we introduce an observational theory and establish stronger equivalences by relying on a proof technique based on bisimulation semantics., Comment: In Proceedings EXPRESS/SOS 2012, arXiv:1208.2440

Published
2012

12. Reducing Weak to Strong Bisimilarity in CCP

Author

Andrés Aristizábal, Frank D. Valencia, Luis Pino, Filippo Bonchi, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), DGA, Marco Carbone, Ivan Lanese, Alexandra Silva, Ana Sokolova, ANR-09-BLAN-0169,PANDA(2009), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Concurrency, F.4, Bisimiliarity, 02 engineering and technology, lcsh:QA75.5-76.95, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Equivalence (formal languages), Equivalence (measure theory), Computer Science - Programming Languages, lcsh:Mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Observable, lcsh:QA1-939, Logic in Computer Science (cs.LO), Partition refinement, 020201 artificial intelligence & image processing, lcsh:Electronic computers. Computer science, Concurrent Constraint Programming, Algorithm, Software, Programming Languages (cs.PL)
Abstract

Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for ccp, and a ccp partition refinement algorithm for deciding the strong version of this equivalence have been proposed. Weak bisimiliarity is a central behavioural equivalence in process calculi and it is obtained from the strong case by taking into account only the actions that are observable in the system. Typically, the standard partition refinement can also be used for deciding weak bisimilarity simply by using Milner's reduction from weak to strong bisimilarity; a technique referred to as saturation. In this paper we demonstrate that, because of its involved labeled transitions, the above-mentioned saturation technique does not work for ccp. We give an alternative reduction from weak ccp bisimilarity to the strong one that allows us to use the ccp partition refinement algorithm for deciding this equivalence., In Proceedings ICE 2012, arXiv:1212.3458. arXiv admin note: text overlap with arXiv:1212.1548

Published
2012

13. K-Stores: A Spatial and Epistemic Concurrent Constraint Interpreter

Author

Barco Santa, Andres Felipe, Knight, Sophia, Valencia, Frank D., Departamento de Electrónica, Pontificia Universidad Javeriana, Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), ANR-09-BLAN-0169,PANDA(2009), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
D.1.3, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Constraint Programming
Abstract

International audience; Concurrent constraint programming (ccp) is a mature formalism for reasoning about concurrent systems that exhibit a constrained behavior. Spatial ccp and epistemic ccp are two novel variants of ccp currently being developed by Knight and Valencia. These variants model systems with spatial hierarchies of group information and knowledge. These systems are ubiquitous due to the advent of social networks and cloud computing where agents may share certain information with certain groups. This paper introduces an interpreter for these extensions we call k-stores. The interpreter is a Prolog implementation of the operational semantics of the languages allowing the programmer to simulate distributed information systems. The main feature consists of an implementation of a spatial (distributed) store that allows epistemic information in it. The system supports the specification of (named) processes along with the ccp classic primitives, namely, ask and tell operations. The declarative view of processes is inherited from the ccp extensions. The orthogonal implementation of the local space abstraction and the epistemic constraint system makes further extensions possible. Special attention is paid to the representation of distributed knowledge and common knowledge

Published
2012

14. Partition Refinement for Bisimilarity in CCP

Author

Andrés Aristizábal, Frank D. Valencia, Luis Pino, Filippo Bonchi, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), ANR-09-BLAN-0169,PANDA(2009), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Concurrency, 02 engineering and technology, Partition Refinement, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Equivalence (formal languages), Equivalence (measure theory), F.4.3, D.3.2, ComputingMilieux_THECOMPUTINGPROFESSION, bisimilarity, concurrent constraint programming, partition refinement, Software, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Logic in Computer Science (cs.LO), Formalism (philosophy of mathematics), Bisimilarity, Partition refinement, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 020201 artificial intelligence & image processing, Concurrent Constraint Programming, Algorithm
Abstract

Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, called the store. Bisimilarity is a standard behavioural equivalence in concurrency theory, but a well-behaved notion of bisimilarity for ccp has been proposed only recently. When the state space of a system is finite, the ordinary notion of bisimilarity can be computed via the well-known partition refinement algorithm, but unfortunately, this algorithm does not work for ccp bisimilarity. In this paper, we propose a variation of the partition refinement algorithm for verifying ccp bisimilarity. To the best of our knowledge this is the first work providing for the automatic verification of program equivalence for ccp, 27th ACM Symposium On Applied Computing, Trento : Italy (2012)

Published
2012

15. Modeling Cellular Signaling Systems: An Abstraction-Refinement Approach

Author

Diana Hermith, Carlos Olarte, Camilo Rueda, Frank D. Valencia, Department of Science and Engineering Computing, Pontificia universidad Javeriana, Cali, Sciences et Technologies de la Musique et du Son (STMS), Institut de Recherche et Coordination Acoustique/Musique (IRCAM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Miguel P. Rocha and Juan M. Corchado Rodriguez and Florentino Fdez-Riverola and Alfonso Valencia, Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)

Subjects
0303 health sciences, 03 medical and health sciences, 021103 operations research, 0211 other engineering and technologies, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 02 engineering and technology, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], 030304 developmental biology
Abstract

International audience; The molecular mechanisms of cell communication with the environment involve many concurrent processes governing dynamically the cell function. This concurrent behavior makes traditional methods, such as differential equations, unsatisfactory as a modeling strategy since they do not scale well when a more detailed view of the system is required. Concurrent Constraint Programming (CCP) is a declarative model of concurrency closely related to logic for specifying reactive systems, i.e., systems that continuously react with the environment. Agents in CCP interact by telling and asking information represented as constraints (e.g., x > 42). In this paper we describe a modeling strategy for cellular signaling systems based on a temporal and probabilistic extension of CCP. Starting from an abstract model, we build refinements adding further details coming from experimentation or abstract assumptions. The advantages of our approach are: due to the notion of partial information as constraints in CCP, the model can be straightforwardly extended when more information is available; qualitative and quantitative information can be represented by means of probabilistic constructs of the language; finally, the model is a runnable specification and can be executed, thus allowing for the simulation of the system. We outline the use of this methodology to model the interaction of G-protein-coupled receptors with their respective G-proteins that activates signaling pathways inside the cell. We also present simulation results obtained from an implementation of the framework

Published
2011

16. Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Author

Catuscia Palamidessi, Frank D. Valencia, Filippo Bonchi, Luis Fernando Pino, Andrés Aristizábal, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Martin Hofmann, Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)

Subjects
Computer science, Concurrency, Process calculus, Theoretical Computer Science, Computer Science (all), 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, Standard definition, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Observational equivalence, Equivalence (formal languages), F.4.3, D.3.2, ComputingMilieux_THECOMPUTINGPROFESSION, Programming language, 020207 software engineering, Process Calculi, Bisimilarity, 010201 computation theory & mathematics, Labelled Semantics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Concurrent Constraint Programming, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], computer
Abstract

International audience; Concurrent constraint programming (ccp) is a well-established model for concurrency that builds upon operational and algebraic notions from process calculi and first-order logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled transition semantics and a novel notion of bisimilarity that is fully abstract w.r.t. the typical observational equivalence in ccp. This way we provide ccp with a new proof technique for ccp coherent with existing ones

Published
2011

17. Concurrent constraints models of music interaction

Author

Mauricio Toro, Camilo Rueda, Frank Valencia, Gerardo Sarria, Carlos Olarte, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Department of Science and Engineering Computing, Pontificia universidad Javeriana, Cali, Sciences et Technologies de la Musique et du Son (STMS), Institut de Recherche et Coordination Acoustique/Musique (IRCAM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and Toro, Mauricio

Subjects
[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Abstract

International audience; In this chapter we follow this "economy of means" way to present several vari- eties of CCP calculi, starting from a very basic one and building from it by adding new features. A fundamental one for music applications is the ability to represent temporal behavior. This can be introduced within the context of determinate (tcc, utcc) or non-determinate (ntcc) computation. For the determinate case, we show how the addition of a process abstraction feature (utcc) allows to model dynamic musical structures in a very simple way. In particular, we model a dynamic version of interactive scores ([ALL 07]). For the nondeterminate case, we use the possibility of defining many alternative computational paths to model an agent following different rhythmic patterns constructed from a given basic one. We then go on to consider a more "metrical" notion of time (rtcc) based on uniform ticks used by processes to define their time of execution in a more fine-grained way, or to cause preemption of other processes at more precisely defined points in time. We use these new "real-time" features to describe a simple model of a basic form of musical dissonances.

Published
2011

18. Automated Reasoning for Derivation of Model-Driven SPLs

Author

Arboleda, Hugo, Vargas, Victor, Diaz Juan, Francisco, Royer, Jean-Claude, Grupo DRISO, Universidad Icesi (ICESI), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Aspect and composition languages (ASCOLA), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Département informatique - EMN, Mines Nantes (Mines Nantes)-Mines Nantes (Mines Nantes)-Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Université de Nantes (UN), Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Lancaster University, Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Département informatique - EMN, Mines Nantes (Mines Nantes)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience; Model-Driven SPL approaches use metamodels and transformation rules to obtain concrete software artifacts departing from models. Most of such approaches use also feature models to express variability. Because of the variability, to derive products, they have to adapt the transformation rules according to user choices captured in feature configurations. In this paper we propose an approach based on Constraint Programming to derive Model-Driven SPLs. Our contribution is twofold. First, we assist product line architects when relating transformation rules and features in order to derive prod- ucts based on feature configurations; the novelty is that we facilitate the management of feature interactions to architects. Second, current approaches to reason on feature models in SPL Engineering only deal with problems related to product configuration. We improve such approaches adding facilities for product derivation.

Published
2010

19. Compositional modelling of signalling pathways in timed concurrent constraint programming

Author

Catuscia Palamidessi, Moreno Falaschi, Davide Chiarugi, Carlos Olarte, Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche 'Roberto Magari' (DSMI), Università degli Studi di Siena = University of Siena (UNISI), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0303 health sciences, Biological data, Molecular interactions, Theoretical computer science, Computer science, Small number, 0102 computer and information sciences, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], 01 natural sciences, Set (abstract data type), Constraint (information theory), 03 medical and health sciences, Order (biology), 010201 computation theory & mathematics, Constraint programming, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Signalling pathways, 030304 developmental biology
Abstract

International audience; The biological data regarding the signalling pathways often consider single pathways or a small number of them. We propose a methodology for composing this kind of data in a coherent framework, in order to be able to investigate a bigger number of signalling pathways. We specify a biological system by means of a set of stoichiometric-like equations resembling the essential features of molecular interactions. We represent these equations by a timed concurrent constraint (ntcc) language, which can deal with partial information and the time for a reaction to occur. We describe a freely available prototypical implementation of our framework.

Published
2010

20. Concurrent and Reactive Constraint Programming

Author

Frank D. Valencia, Maurizio Gabbrielli, Catuscia Palamidessi, AGOSTINO DOVIER, ENRICO PONTELLI, M.Gabbrielli, C.Palamidessi, F. D. Valencia, Dipartimento di Scienze dell'Informazione [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Foundations of Component-based Ubiquitous Systems (FOCUS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Dipartimento di Informatica - Scienza e Ingegneria [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)-Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Agostino Dovier and Enrico Pontelli, École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Concurrent constraint logic programming, Theoretical computer science, Computer science, Functional logic programming, Programming language, Concurrency Theory, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, Constraint satisfaction, computer.software_genre, 01 natural sciences, Process Calculi, Concurrent object-oriented programming, 010201 computation theory & mathematics, Constraint logic programming, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Reactive programming, D.3.2, F.4.3, Concurrent Constraint Programming, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], computer, Logic programming
Abstract

The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification, and timed extensions. In this paper we review the main lines of research and contributions of the community in this field.

Published
2010

21. Musical Composition with Stochastic Context-Free Grammars

Author

Perchy, Salim, Sarria, Gerardo, Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), and PERCHY, Salim

Subjects
[SHS.MUSIQ] Humanities and Social Sciences/Musicology and performing arts, JS Bach, [SHS.MUSIQ]Humanities and Social Sciences/Musicology and performing arts, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], Musical Composition, Stochastic Context-Free Grammars, Computer Music, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; In this paper we discuss the design of a generator of musical sequences for the purpose of aiding musicians in their compositional work. A series of steps were abstracted to reflect composition as a sequential flow of data refination; also each step involved in this process was modeled to gain each one of their functions. Specifically, in the case of the main structure of the suggestion a stochastic context-free grammar was developed to generate harmonic progressions, in the case of rhythms a probabilistic model based on accents was also developed, and finally, to state individual notes of the suggestion another probabilistic model based in the dissonance of intervals was used. Each one of these models were structured upon J.S. Bach's rules of homophonic composition as this was the target musical genre of the work

Published
2009

22. DISSONANCES: BRIEF DESCRIPTION AND ITS COMPUTATIONAL REPRESENTATION IN THE RTCC CALCULUS

Author

Salim Perchy, Gerardo M. Sarria M., Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Fabien Gouyon, PERCHY, Salim, Álvaro Barbosa, and Xavier Serra

Subjects
ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [INFO.INFO-MM] Computer Science [cs]/Multimedia [cs.MM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Music Composition, Music and sound, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], Computer music, Process calculus
Abstract

International audience; Dissonances in music have had a long evolution history dating back to days of strictly prohibition to times of en-richeness of musical motives and forms. Nowadays, dis-sonances account for most of the musical expressiveness and contain a full application theory supporting their use making them a frequently adopted resource of composition. This work partially describes their theoretical background as well as their evolution in music and finally proposing a new model for their computational use

Published
2009

23. Declarative diagnosis of temporal concurrent constraint programs

Author

Catuscia Palamidessi, Frank D. Valencia, Carlos Olarte, Moreno Falaschi, Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche 'Roberto Magari' (DSMI), Università degli Studi di Siena = University of Siena (UNISI), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Verónica Dahl and Ilkka Niemelä, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Theoretical computer science, Correctness, Computer science, Programming language, media_common.quotation_subject, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, Abstract interpretation, computer.software_genre, 01 natural sciences, Denotational semantics of the Actor model, Nondeterministic algorithm, Algorithmic program debugging, Denotational semantics, Linear temporal logic, Debugging, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, computer, media_common
Abstract

International audience; We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check the correctness of D by a single step of TD. In order to develop an effective debugging method, we approximate the denotational semantics of D. We formalize this method by abstract interpretation techniques, and we derive a finitely terminating abstract diagnosis method, which can be used statically. We define an abstract domain which allows us to approximate the infinite sequences by a finite ‘cut'. As a further development we show how to use a specific linear temporal logic for deriving automatically the debugging sequences. Our debugging framework does not require the user to either provide error symptoms in advance or answer questions concerning program correctness. Our method is compositional, that may allow to master the complexity of the debugging methodology.

24. Toward a Formal Model for Group Polarization in Social Networks

Author

Frank D. Valencia, Mário S. Alvim, Sophia Knight, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), University of Minnesota [Duluth], University of Minnesota System, Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), ECOS-NORD project FACTS (C19M03), Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank Valencia, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
business.industry, Computer science, media_common.quotation_subject, Formal Model for Polarization, 05 social sciences, Polarization (politics), Proposition, 0102 computer and information sciences, Polarization in Social Networks, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 01 natural sciences, Rational belief, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], ACM: H.: Information Systems/H.1: MODELS AND PRINCIPLES, 0506 political science, [INFO.INFO-CY]Computer Science [cs]/Computers and Society [cs.CY], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], 010201 computation theory & mathematics, Confirmation bias, Irrational number, 050602 political science & public administration, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, media_common
Abstract

International audience; In this paper we develop a preliminary model for social networks , and a measure of the level of polarization in these social networks, based on Esteban and Ray's classic measure of polarization for economic situations. Our model includes information about each agent's quantitative strength of belief in a proposition of interest and a representation of the strength of each agent's influence on every other agent. We consider how the model changes over time as agents interact and communicate, and include several different options for belief update, including rational belief update and update taking into account irrational responses such as confirmation bias and the backfire effect. Under various scenarios, we consider the evolution of polarization over time, and the implications of these results for real world social networks.

Catalog

Books, media, physical & digital resources
See catalog results