Concurrency Theory

  • M.P.Fiore and S.Staton.   Positive structural operational semantics and monotone distributive laws..  In Short Contributions for the 10th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2010), CWI Technical report SEN-1004, pages~8--9, 2010.

    •  
  • M.P.Fiore and S.Staton.   A congruence rule format for name-passing process calculi.  Information and Computation, 207(2):209-236, 2009. 

    •  
  • M.P.Fiore and S.Staton.   A congruence rule format for name-passing process calculi from mathematical structural operational semantics.  In 21st Logic in Computer Science Conf. (LICS'06), pages 49-58.  IEEE, Computer Society Press, 2006.  [preprint]

    •  
  • M.P.Fiore and S.Staton.  Comparing operational models of name-passing process calculi.  In the special issue for the 7th International Workshop on Coalgebraic Methods in Computer Science (CMCS'04), Information and Computation, 240(4):524-560, 2006.  [preprint]  (Preliminary version in 7th International Workshop on Coalgebraic Methods in Computer Science (CMCS'04), Electronic Notes in Theoretical Computer Science, 106:91-104. Elsevier, 2004.)

    •  
  • M.P.Fiore, E.Moggi and D.Sangiorgi. A fully-abstract model for the pi-calculus .  Information and Computation 179, 76-117 (2002) [ps file].  (Preliminary version in 11th Logic in Computer Science Conf. (LICS'96), pages 43-54.  IEEE, Computer Society Press, 1996.  [ ps file])

    •  
  • M.P.Fiore and M.Abadi.  Computing symbolic models for verifying cryptographic protocols .   In 14th Computer Security Foundations Workshop (CSFW-14), pages 160-173.  IEEE, Computer Society Press, 2001.  [ps file ]

    •  
  • M.P.Fiore and D.Turi.  Semantics of name and value passing .   In 16th Logic in Computer Science Conf. (LICS'01), pages 93-104.  IEEE, Computer Society Press, 2001.  [ps file ]

    •  
  • M.P.Fiore.  Fibred models of processes: Discrete, continuous, and hybrid systems.   In proceedings of the IFIP TCS2000 Conf., pages 457-473, Springer-Verlag, 2000.  [ps file ]

    •  
  • M.Bunge and M.P.Fiore.  Unique factorisation lifting functors and categories of linearly-controlled processes.  Mathematical Structures in Computer Science,, 10(2):137-163, Cambridge University Press, 2000.  [ps file ]

    •  
  • M.P.Fiore and G.L.Cattani and G.Winskel. Weak bisimulation and open maps.  In 14th Logic in Computer Science Conf. (LICS'99), pages 67-76.  IEEE, Computer Society Press, 1999.  [ps file]

    •  
  • G.L.Cattani, M.P.Fiore and G.Winskel. A theory of recursive domains with applications to concurrency.  In 13th Logic in Computer Science Conf. (LICS'98), pages 214-225.  IEEE, Computer Society Press, 1998.  [ps file]

    •  
  • M.P.Fiore and K.Honda.  Recursive types in games: Axiomatics and process representation.  In 13th Logic in Computer Science Conf. (LICS'98), pages 345-356.  IEEE, Computer Society Press, 1998.  [ps file]