Bibliography

Reference and Value Semantics Are Equivalent for Ordinary Object Petri Nets

Michael Köhler and Heiko Rölke.
Reference and value semantics are equivalent for ordinary object Petri nets.
In Gianfranco Ciardo and Philippe Darondeau, editors, Proceedings of the 26th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency, volume 3536 of Lecture Notes in Computer Science, pages 309-328. Springer-Verlag, June 2005.  [link]

Abstract: The concept of mobile agents imposes a great security risk for information systems. In this paper we propose object nets as a specification formalism for multi-agent systems. Since the general formalism is Turing-powerful not every analysis method that is common for Petri net can be applied. So, we define the subclass of ``ordinary'' object nets that allows for the application of standard P/T-net techniques, i.e. the computation of boundedness, liveness etc.

BibTeX entry

@InProceedings{Koehler+05a,
  author =   {K{\"o}hler, Michael and R{\"o}lke, Heiko},
  title =   {Reference and Value Semantics Are Equivalent for Ordinary Object {Petri} Nets},
  booktitle =  {Proceedings of the 26th International Conference on Application and Theory
of {Petri} Nets and Other Models of Concurrency},
  pages =  {309--328},
  editor =  {Ciardo, Gianfranco and Darondeau, Philippe},
  year =  2005,
  volume =  3536,
  series =  LNCS,
  month =  {June},
  publisher =  Springer,
  url =  {https://link.springer.com/openurl?genre=article&id=doi:10.1007/11494744_18},
  xdoi =   {10.1007/11494744_18},
  abstract = {The concept of mobile agents imposes a great security
                  risk for information systems. In this paper we
                  propose object nets as a specification formalism for
                  multi-agent systems. Since the general formalism is
                  Turing-powerful not every analysis method that is
                  common for Petri net can be applied. So, we define
                  the subclass of ``ordinary'' object nets that allows
                  for the application of standard P/T-net techniques,
                  i.e. the computation of boundedness, liveness etc.}
}

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.