Modularity for system modelling and analysis

[1]  Benoît Caillaud,et al.  Modular System Development with Pullbacks , 2003, ICATPN.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  S. Lane.  Categories for the Working Mathematician , 1971 .

[4]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[5]  Charles Lakos,et al.  On the Abstraction of Coloured Petri Nets , 1997, ICATPN.

[6]  Glynn Winskel,et al.  The unfolding of general Petri nets , 2008, FSTTCS.

[7]  Eric Fabre,et al.  On the Construction of Pullbacks for Safe Petri Nets , 2006, ICATPN.

[8]  Ferigato Carlo,et al.  Inference of Local Properties in Petri Nets Composed through an Interface , 2012 .

[9]  Giovanni Denaro,et al.  Petri Nets and Software Engineering , 2003, Lectures on Concurrency and Petri Nets.

[10]  J. Todd Wittbold,et al.  Information flow in nondeterministic systems , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[11]  Luca Bernardinello,et al.  Local state refinement on Elementary Net Systems: an approach based on morphisms , 2012, PNSE.

[12]  E Mangioni.  Morphisms for composition on interfaces , 2011 .

[13]  Milan Urbásek,et al.  Rule-Based Refinement of Petri Nets: A Survey , 2003, Petri Net Technology for Communication-Based Systems.

[14]  Laurent Mazare,et al.  Using Unification For Opacity Properties , 2004 .

[15]  Roberto Gorrieri,et al.  Classification of Security Properties (Part I: Information Flow) , 2000, FOSAD.

[16]  Luca Bernardinello,et al.  On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces , 2007, Fundam. Informaticae.

[17]  Walter Vogler,et al.  Executions: A New Partial-Order Semantics of Petri Nets , 1991, Theor. Comput. Sci..

[18]  Paolo Baldan,et al.  Distributed Unfolding of Petri Nets , 2006, FoSSaCS.

[19]  Manuel Silva Suárez,et al.  Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems , 1996, Petri Nets.

[20]  Gérard Boudol,et al.  Secure Information Flow as a Safety Property , 2009, Formal Aspects in Security and Trust.

[21]  Carla Simone,et al.  A survey of equivalence notions for net based systems , 1992, Advances in Petri Nets: The DEMON Project.

[22]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[23]  Glynn Winskel,et al.  Topics in Concurrency Lecture Notes , 2009 .

[24]  C. A. Petri.  Concepts of Net Theory , 1973, MFCS.

[25]  Roberto Gorrieri,et al.  On the Decidability of Non Interference over Unbounded Petri Nets , 2010, SecCo.

[26]  Glynn Winskel,et al.  Petri Nets and Bisimulation , 1996, Theor. Comput. Sci..

[27]  Jörg Desel,et al.  Vicinity Respecting Homomorphisms for Abstracting System Requirements , 2010, Trans. Petri Nets Other Model. Concurr..

[28]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.

[29]  Grzegorz Rozenberg,et al.  Elementary Transition Systems , 1990, Theor. Comput. Sci..

[30]  Jörg Desel,et al.  Basic Linear Algebraic Techniques for Place or Transition Nets , 1996, Petri Nets.

[31]  Roberto Gorrieri,et al.  A Survey on Non-interference with Petri Nets , 2003, Lectures on Concurrency and Petri Nets.

[32]  Eike Best,et al.  Nonsequential Processes: A Petri Net View , 1988 .

[33]  Luca Bernardinello,et al.  Formal Tools for Modular System Development , 2004, ICATPN.

[34]  Roberto Gorrieri,et al.  Petri Net Security Checker: Structural Non-interference at Work , 2009, Formal Aspects in Security and Trust.

[35]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[36]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[37]  Luca Bernardinello,et al.  Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms , 2013, Trans. Petri Nets Other Model. Concurr..

[38]  Marek A. Bednarczyk,et al.  On Concurrent Realization of Reactive Systems and Their Morphisms , 2001, Unifying Petri Nets.

[39]  Theo Dimitrakos,et al.  Formal Aspects in Security and Trust, Fourth International Workshop, FAST 2006, Hamilton, Ontario, Canada, August 26-27, 2006, Revised Selected Papers , 2007, Formal Aspects in Security and Trust.

[40]  R. F. C. Walters,et al.  Categories and computer science , 1992, Cambridge computer science texts.

[41]  Manuel Silva Suárez,et al.  Circuits, handles, bridges and nets , 1991, Applications and Theory of Petri Nets.

[42]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[43]  Grzegorz Rozenberg,et al.  Elementary transition systems and refinement , 2005, Acta Informatica.

[44]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[45]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.