1. 1 IFIP WG1.3, Udine, September 12, 2009 - 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. 2 IFIP WG1.3, Udine, September 12, 2009 - 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. 3 IFIP WG1.3, Udine, September 12, 2009 - 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. 9 IFIP WG1.3, Udine, September 12, 2009 - 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

12. : states with name symmetries

13. 13 IFIP WG1.3, Udine, September 12, 2009 - 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

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

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

21. 21 IFIP WG1.3, Udine, September 12, 2009 - 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. 25 IFIP WG1.3, Udine, September 12, 2009 - 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

27. Generating fresh names

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

30. Garbage collecting unused names

33. Product in named sets

39. Inputting names

43. 43 IFIP WG1.3, Udine, September 12, 2009 - 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. 46 IFIP WG1.3, Udine, September 12, 2009 - 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