1 IFIP WG1.3, Udine, September 12, 2009 - Ugo Montanari, Coalgebras for Named Sets Ugo Montanari Dipartimento di Informatica Università di Pisa Coalgebras.

Slides:



Advertisements
Similar presentations
InDiCo Luxembourg, 16 May 2002 Integrated Digital Conferencing.
Advertisements

I Sistemi Positivi Grafi dinfluenza: irriducibilità, eccitabilità e trasparenza Lorenzo Farina Dipartimento di informatica e sistemistica A. Ruberti Università
UNIVERSITÀ DEGLI STUDI DI PERUGIA Dipartimento di Ingegneria Industriale Prof. Francesco Castellani Corso di Meccanica Applicata A.
UNIVERSITÀ DEGLI STUDI DI PERUGIA Dipartimento di Ingegneria Industriale Prof. Francesco Castellani Corso di Meccanica Applicata A.
ECO and Object Grammars: two methods for the enumeration of combinatorial objects Simone Rinaldi Dipartimento di Scienze Matematiche e Informatiche Roberto.
Paolo Atzeni - Pierluigi Del Nostro Università Roma Tre Dipartimento di Informatica e Automazione T-Araneus: Management of temporal data-intensive Web.
CommUnity, Tiles and Connectors joint work with Roberto Bruni José Luiz Fiadeiro Antónia Lopes Ugo Montanari Ivan Lanese Dipartimento di Informatica Università.
Connectors and Concurrency joint work with Ugo Montanari Roberto Bruni Dipartimento di Informatica Università di Pisa Dagstuhl Seminar #04241, September.
Ultra Low Power RF Section of a Passive Microwave RFID Transponder in 0.35 μm BiCMOS Giuseppe De Vita, Giuseppe Iannaccone Dipartimento di Ingegneria dell’Informazione:
Departamento de Computación Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires (UBA) (*) VERIMAG, France. Currently visiting UBA. 1.
1June 7, 2004Ontologies for interoperability1 Ontology-based data integration Maurizio Lenzerini Dipartimento di Informatica e Sistemistica “A. Ruberti”
Latent Semantic Indexing (mapping onto a smaller space of latent concepts) Paolo Ferragina Dipartimento di Informatica Università di Pisa Reading 18.
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Marcello Bonsangue, Stefan Milius, Alexandra Silva Coalgebras and Generalized Regular.
Roberto Pisa, Italy 13 June 2008 WADT Tiles for Reo Roberto Bruni Dipartimento di Informatica Università di Pisa WADT th International.
SHReQ: Coordinating Application Level QoS Speaker: Ivan Lanese Dipartimento di Informatica Università di Pisa Authors: Dan Hirsch & Emilio Tuosto Dipartimento.
Boolean Algebra Applications1 BOOLEAN ALGEBRA APPLICATIONS RELIABILITY OF CIRCUITS.
1 Formal Models for Distributed Negotiations Description Roberto Bruni Dipartimento di Informatica Università di Pisa XVII Escuela de Ciencias Informaticas.
Synchronization Algebras with Mobility for Graph Transformations joint work with Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan Lanese.
1 Ugo Montanari Dipartimento di Informatica Università di Pisa Roberto Bruni, GianLuigi Ferrari, Hernan Melgratti, Emilio Tuosto (Pisa) Cosimo Laneve (Bologna)
1 Formal Models for Distributed Negotiations Concurrent Languages Translation Roberto Bruni Dipartimento di Informatica Università di Pisa XVII Escuela.
Hernán Melgratti joint work with Roberto Bruni and Ugo Montanari Dipartimento di Informatica - Università di Pisa Flat Committed Join in Join.
New insights on architectural connectors joint work with Roberto Bruni University of Pisa, Italy Ugo Montanari University of Pisa, Italy José Luiz Fiadeiro.
1 Formal Models for Distributed Negotiations Exercises Roberto Bruni Dipartimento di Informatica Università di Pisa XVII Escuela de Ciencias Informaticas.
1 Ivan Lanese Dipartimento di Informatica Università di Pisa Ugo Montanari From Graph Rewriting to Logic Programming joint work with.
1 Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming joint work with Ugo Montanari Ivan Lanese Dipartimento di Informatica Università.
1 Formal Models for Transactions: Zero Safe Nets Roberto Bruni Dipartimento di Informatica Università di Pisa Models and Languages for Coordination and.
1 CoMeta, final workshop, /12/2003 Ivan Lanese Dipartimento di Informatica Università di Pisa Ugo Montanari A graphical Fusion Calculus Joint work.
Modeling a Service and Session Calculus with Hierarchical Graph Transformation Roberto Bruni, Andrea Corradini, Ugo Montanari (based on joint work with.
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Modeling Community with Tiles joint work with Ivan Lanese Ugo Montanari Dipartimento di Informatica Università di Pisa Roberto Bruni Dipartimento di Informatica.
An algebra of Connectors for modeling CommUnity with Tiles joint work with Roberto Bruni Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan.
1 Formal Models for Transactions: BizTalk as ZSN Roberto Bruni Dipartimento di Informatica Università di Pisa Models and Languages for Coordination and.
Dipartimento di Informatica Università di Pisa Nested Commits for Mobile Calculi: Extending Join Roberto Bruni, Hernán Melgratti and Ugo Montanari.
Complete Axioms for Stateless Connectors joint work with Roberto Bruni and Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan Lanese Dipartimento.
Synchronizations with Mobility for Graph Transformations joint work with Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan Lanese Dipartimento.
Unit Four - Functions 8.F.1 Understand that a function is a rule that assigns exactly one output to each input. The graph of a function is the set of ordered.
Supporting Domain-Expert Users Pisa, September 2002 Maria Francesca Costabile Dipartimento di Informatica, Università di Bari, Italy
EUROPE. September 08 to 11 September 12 to 14 September - 15.
Pisa, 11/25/2002Susanna Donatelli1 Modelling process and heterogeneous model construction Susanna Donatelli Modelling and evaluation groups.
Coalgebraic Symbolic Semantics Filippo Bonchi Ugo Montanari.
1 G.R. Gangadharan 1, Hong-Linh Truong 2, Martin Treiber 2, Vincenzo D‘Andrea 1, Schahram Dustdar 2, Renato Iannella 3, Michael Weiss 4
L’età della parola Giuseppe Attardi Dipartimento di Informatica Università di Pisa ESA SoBigDataPisa, 24 febbraio 2015.
John Stuart Mill and Henry Sidgwick Marco E.L. Guidi Università di Pisa Dipartimento di Scienze Economiche.
1 Random generation of words with fixed occurrences of symbols in regular languages A. Bertoni P. Massazza R. Radicioni 1 Università degli Studi di Milano,
A Case Study on Automated Generation of Integration Tests Giuseppe Della Penna, Alberto Tofani Dipartimento di Informatica, Università di L’Aquila Marcello.
The Magic of TOOLS Enrico Tronci Dipartimento di Informatica, Università di Roma “La Sapienza” Via Salaria 113, Roma
Relations and Functions Intermediate Algebra II Section 2.1.
COOPERATIVE LEARNING IN EFL CLASSROOM
Dynamic Symmetry breaking with AI and Algebra. Iain McDonald Dynamic Symmetry breaking with AI and Algebra.
Recommendation systems Paolo Ferragina Dipartimento di Informatica Università di Pisa Slides only!
WP5: Dynamic Analysis Presented by Pierpaolo Degano Dipartimento di Informatica Università di Pisa at the Final review of DEGAS, 6 April 2005.
Function Tables and Graphs. Function A function is when each input (x-value) corresponds to exactly one output (y- value) In other words, when you substitute.
DAY 8 Using Identity and Inverse to Write Equivalent Expressions.
General Description of Network Systems  Ugo Montanari  Dipartimento di Informatica, University of Pisa CINA: Compositionality, Interaction, Negotiation,
78th IETF – IPPM WG IPPM metrics registry extension draft-stephan-ippm-registry-ext-00.txt 78th IETF Meeting – July 2010.
Rewriting Nested Graphs, through Term Graphs Roberto Bruni, Andrea Corradini, Fabio Gadducci Alberto Lluch Lafuente and Ugo Montanari Dipartimento di Informatica,
Paolo Ferragina Dipartimento di Informatica, Università di Pisa
Seminar on Statistical Data Collection Geneva, 25 – 27 September 2013
Algebra 1 September 22, 2016.
Index construction: Compression of postings
Research about an electronic device
PRODUCT ROADMAP TITLE Q1 Q2 Q3 Q4 Q4 Q3 Q2 Q1 Q1 Q2 Q3 Q4 20XX 20XX
General Meeting Etelsen July 4-6, 2010
Paolo Ferragina Dipartimento di Informatica, Università di Pisa
Algebra Collecting Like Terms.
Selection Sort Fonte: Fondamenti di Informatica - A.Accattatis Selection Sort Fonte:
PRODUCT ROADMAP TITLE Q1 Q2 Q3 Q4 Q4 Q3 Q2 Q1 Q1 Q2 Q3 Q4 20XX 20XX
Open Discussion Questions in re: the Roadmap
LANGUAGE EDUCATION.
Science and Industry for Environment,
Presentation transcript:

1 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Ugo Montanari Dipartimento di Informatica Università di Pisa Coalgebras for Named Sets Work in collaboration with Vincenzo Ciancia Universidad Complutense Madrid IFIP WG1.3, Udine, September 12, 2009

2 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

3 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

9 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

: states with name symmetries

13 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

Axioms:  (  ’(x)=  o  ’(x) id(x)=x

 ((A,{  A })) = (a,{  A +1 })  (f) = f

21 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

25 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

Generating fresh names

Exactly corresponds to  ((A,{  A })) = (a,{  A +1 })  (f) = f

Garbage collecting unused names

Product in named sets

Inputting names

43 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion

46 IFIP WG1.3, Udine, September 12, Ugo Montanari, Coalgebras for Named Sets Roadmap l Models for nominal process description languages l The basic idea of named sets l Permutation algebras l Named sets l Operations on named sets –Generating fresh names and garbage collecting unused ones –Product in named sets –Inputting names l Generalizing MIHDA l Conclusion