@article{Oanea2011,
title = "Boundedness of adaptive nets is decidable",
author = "Olivia Oanea",
journal = "Information Processing Letters",
volume = "111",
number = "15",
pages = " 738–743 ",
year = "2011",
issn = "0020-0190",
doi = "DOI: 10.1016/j.ipl.2011.05.004",
url ="http://www.sciencedirect.com/science/article/B6V0F-52T77VH-3/2/2b5c6b614375d6d723cee44cbc0e5ece"}

@inproceedings{DBLP:conf/icsoc/OaneaSW10,
  author    = {Olivia Oanea and
               Jan S{\"u}rmeli and
               Karsten Wolf},
  title     = {Service Discovery Using Communication Fingerprints},
  booktitle = {ICSOC},
  series    = {Lecture Notes in Computer Science},
  volume    = {6470},
  year      = {2010},
  pages     = {612-618},
  ee        = {http://dx.doi.org/10.1007/978-3-642-17358-5}
}

@inproceedings{OaneaWW_2010_atpn,
  Author = {Olivia Oanea and Harro Wimmel and Karsten Wolf},
  Booktitle = {31st International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, PETRI NETS 2010, Braga, Portugal, June 21-25, 2010, Proceedings},
  Editor = {Johan Lilius and Wojciech Penczek},
  Month = jun,
  Pages = {267-286},
  Publisher = {Springer-Verlag},
  Series = {Lecture Notes in Computer Science},
  Title = {New Algorithms for Deciding the Siphon-Trap Property},
  Volume = {6128},
  Year = {2010}
  }

@inproceedings{Zeus2010,
Author = {Olivia Oanea},
Booktitle = {2nd Central-European Workshop on Services and their Composition, ZEUS 2010, Preliminary Proceedings},
Editor = {Chr. Gierds and J. Suermeli},
Pages = {134-141},
Publisher = {Humbolt Universitaet zu Berlin},
Title = {Quick adaptability checks},
Volume = {Informatik Bericht Nr. 233},
Year = {2010},
ee        = {http://edoc.hu-berlin.de/docviews/abstract.php?lang=ger&id=38001}
}

@inproceedings{MennickeOW_2009_awpn,
Author = {Stephan Mennicke and Olivia Oanea and Karsten Wolf},
Booktitle = {16th German Workshop on Algorithms and Tools for Petri Nets, AWPN 2009, Karlsruhe, Germany, September 25, 2009, Proceedings},
Editor = {Thomas Freytag and Andreas Eckleder},
Month = sep,
Pages = {29-34},
Publisher = {CEUR-WS.org},
Series = {CEUR Workshop Proceedings},
Title = {Decomposition into open nets},
Volume = {501},
Year = {2009}
}

We study the decomposition of an arbitrary Petri net into open nets. This means that shared places can be seen as message channels between components. We show that there exists a unique decomposition into atomic components which can be efficiently computed. We further show that every composition of components yields a component and that every component can be built from atomic components. Finally, we briefly discuss potential applications.

@inproceedings{OaneaW_2009_zeus,
Author = {Olivia Oanea and Karsten Wolf},
Booktitle = {Proc. of ZEUS 2009},							
Pages = {81-87},
Publisher = {CEUR-WS.org},
Series = {CEUR Workshop Proceedings},
Title = {An efficient necessary condition for compatibility},
Volume = {438},
Year = {2009}}

Composing services makes sense only if they are compatible, i.e. composition does not lead to problems such as livelocks or deadlocks. In general, compatibility can be checked using state space explorations on any kind of formal models of services. Petri nets, one of the formal model in use, offer a rich theory for reasoning without exploring a state space. Among the techniques is the so-called state equation which forms a linear algebraic necessary condition for reachability of states. In this article, we show how the state equation can be applied for a necessary condition for compatibility. This way, the number of expensive state space based compatibility checks can be drastically reduced. The condition can be applied even if compatibility is achieved through the construction of a behavioral adapter (mediator).

@inproceedings{OO081,
  author    = "Olivia Oanea",
  title     = "Soundness and related concepts for nested workflow nets",
   booktitle = {Proc. of the International Workshop on
Petri Nets and Distributed Systems (PNDS'2008)},
  year      = {2008}}

@phdthesis{O07,
  author    = "Olivia Oanea",
  title     = "Verification of soundness and other properties of business processes",
  school = {Department of Mathematics and Computer Science, Eindhoven University of Technology},
  year      = {2007}}

@inproceedings{HeeOSV06,
  author    = "{\noopsort{Hee}}{K. van Hee} and Olivia Oanea and Natalia Sidorova and Marc Voorhoeve",
  title     = "Verifying Generalized Soundness for Workflow Nets",
  booktitle = {Proc. of the 6th International Conference on Perspectives of System Informatics, PSI'2006,
  Novosibirsk},
  publisher = {Springer},
  series    = "LNCS",
   volume    = {4378},
  pages     = {235-247},
  year      = {2007}}

@article{fi07,
  AUTHOR =       "{\noopsort{Hee}{van Hee}}, K. and I. A. Lomazova and O. Oanea and A. Serebrenik and N. Sidorova and M. Voorhoeve",
  TITLE =        "Checking Properties of Adaptive Workflow Nets",
   journal =    "{Fund. Inform.}",
 volume = {79},
 number = {3-4},
 pages = {347--362},
  YEAR = "2007"
}
                            

@inproceedings{DBLP:conf/bpm/HeeOSSV06,
  author    = {Kees M. van Hee and
               Olivia Oanea and
               Alexander Serebrenik and
               Natalia Sidorova and
               Marc Voorhoeve},
  title     = {History-Based Joins: Semantics, Soundness and Implementation.},
  booktitle = {Business Process Management},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4102},
  year      = {2006},
  pages     = {225-240}}

@INPROCEEDINGS{awHLOSSV06,
  AUTHOR =       "{\noopsort{Hee}}{K. van Hee} and I. Lomazova and O. Oanea and A. Serebrenik and N. Sidorova and M. Voorhoeve",
  TITLE =        "Nested {N}ets for {A}daptive {S}ystems",
  BOOKTITLE =    "Proc. of the 27th {I}nternational {C}onference on {A}pplication and {T}heory of
{P}etri {N}ets",
  series = "LNCS",
  volume = "4024",
  pages = "241-260",
  YEAR =  "2006"}

@article{HOPW06,
author = "{\noopsort{Hee}}{K. van Hee} and Olivia Oanea and Reinier Post and Lou Somers and Jan Martijn van der Werf",
title = {Yasper: a tool for workflow modeling and analysis},
journal = "Proceedings of the 5th {I}nternational {C}onference on {A}pplication of {C}oncurrency to {S}ystem {D}esign ({ACSD} 2006)",
publisher = {IEEE Computer Society},
year = {2006},
pages = {279-282}}

@article{scp06,
 author = {{\noopsort{Hee}{van Hee}}, K. and O. Oanea and A. Serebrenik and N. Sidorova and M. Voorhoeve},
 title = {LogLogics: A logic for history-dependent business processes},
 journal = {Sci. Comput. Program.},
 volume = {65},
 number = {1},
 year = {2007},
 pages = {30--40}
 }

@inproceedings{DBLP:conf/vveis/HeeOSSV06,
  author    = {{\noopsort{Hee}}{K. van Hee} and
               Olivia Oanea and
               Alexander Serebrenik and
               Natalia Sidorova and
               Marc Voorhoeve},
  title     = {Modelling History-Dependent Business Processes.},
  booktitle = {MSVVEIS},
  year      = {2006},
  pages     = {76-85}}

@inproceedings{DBLP:conf/otm/HeeOS05,
  author    = {{\noopsort{Hee}}{K. van Hee} and Olivia Oanea and Natalia Sidorova},
  title     = {Colored {P}etri Nets to Verify Extended Event-Driven Process Chains.},
  booktitle = {OTM Conferences (1)},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3760},
  year      = {2005},
  pages     = {183-201}}

@inproceedings{synasc06,
  author    = {Ferucio L. Tiplea and Olivia Oanea},
  title     = {Model Checking for Linear Time mu-calculus and Extended Petri Nets},
  booktitle = {5th International Workshop "Symbolic and Numeric Algorithms for Scientific Computing" {SYNASC} 2003, Timisoara (Romania), Oct 1-4},
  pages     = {297-310},
  year      = {2006}
}

@Article{Melinte02,
  author =       "Roxana Melinte and O. Oanea and I. Olga and F. L.
                 Tiplea",
  title =        "The home marking problem and some related concepts.",
  journal =      "Acta Cybernetica 15",
  pages =        "467--478",
  year =         "2002"
  }

In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home marking problem for inhibitor Petri nets is undecidable. We relate then the existence of home markings to confluence and noetherianity and prove that confluent and noetherian Petri nets have an unique home marking. Finally, we define some versions of the state space inclusion problem related to the home marking and sub-marking problems, and discuss their decidability status.