<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Newcastle upon Tyne, UK, June</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Application of Region Theory (ART)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Preface</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <volume>21</volume>
      <issue>2011</issue>
      <abstract>
        <p>11th International Conference on Application of Concurrency to System Design (ACSD 2011) 32nd International Conference on Application and Theory of Petri Nets (PETRI NETS 2011)</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Satellite event of the conferences</title>
      <p>Regions have been defined about 20 years ago by Andrzej Ehrenfeucht and
Grzegorz Rozenberg as sets of nodes of a finite transition system that correspond
to potential conditions that enable or disable transition occurrences in a
corresponding elementary net system. Thus, regions have been the essential
concept for synthesis of an elementary net systems from its anonymous state
graph (states are unknown but transitions between states are known). Since that
time, many generalizations and variants of the synthesis problem of Petri nets
from behavioral descriptions have been studied, including synthesis of more
general Petri net classes, synthesis from languages, synthesis from partially
ordered runs and synthesis from incomplete behavioral descriptions. All this
work has in common that the transition names are given more or less directly by
the behavioral description. The places of the net to be synthesized always
correspond to regions which are defined in many different ways, depending on
the form of the behavioral description. A main issue in this research is the study
of regions, whence we call the entire research direction region theory.
Region Theory was applied in many different areas such as
hardware synthesis from precise specifications (synthesis from transition
systems)
visualization of concurrent hardware behavior (synthesis from logic
circuit models, transition systems and partial orders)
GALS synthesis and desynchronisation based on synthesis (synthesis
from step transition systems and re-synthesis from Petri nets)
synthesis of control and policies for discrete event systems (synthesis
from both languages and transition systems)
modelling biological (membrane) systems with localities (synthesis from
step transition systems)
generation of specifications from incomplete specifications (mining from
transition systems)
model generation from examples (specification from (partial) languages)
mining of process descriptions (mining from languages)
The aim of the ART workshop series was to bring together people working in
these or other application areas of region theory, to exchange ideas and concepts
and to work on common workshop results.</p>
      <p>This proceedings volume contains reviewed contributions submitted to and
presented at the 2nd ART workshop.</p>
    </sec>
    <sec id="sec-2">
      <title>Jörg Desel (Hagen, Germany) Alex Yakovlev (Newcastle University, UK) June 2011</title>
    </sec>
    <sec id="sec-3">
      <title>Wil van der Aalst</title>
      <p>Do Petri Nets Provide the Right Representational Bias for Process Mining? ... 85</p>
    </sec>
    <sec id="sec-4">
      <title>Josep Carmona, UPC Barcelona, Spain</title>
      <p>Philippe Darondeau, INRIA Rennes, France
Jörg Desel, FernUniversität in Hagen, Germany (co-chair)
Boudewijn van Dongen, TU Eindhoven, The Netherlands
Luís Gomes, Universidade Nova de Lisboa, Portugal
Gabriel Juhás, Slovak University of Technology, Slovak Republic
Jetty Kleijn, Leiden University, The Netherlands
Alex Kondratyev, Cadence Design Systems Inc., Berkeley CA, USA
Luciano Lavagno, Politecnico di Torino, Italy
Robert Lorenz, Universität Augsburg, Germany
Marta Pietkiewicz-Koutny, Newcastle University, UK
Grzegorz Rozenberg, Leiden University, The Netherlands
Akex Yakovlev, Newcastle University, UK (co-chair)
Mengchu Zhou, New Jersey Institute of Technology, USA</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Jetty</given-names>
            <surname>Kleijn</surname>
          </string-name>
          , Maciej Koutny,
          <article-title>Marta Pietkiewicz-Koutny and Grzegorz Rozenberg Classifying Boolean Nets for Region-based</article-title>
          <string-name>
            <surname>Synthesis.......................................... 5</surname>
          </string-name>
          <article-title>Boudewijn van Dongen, Jörg Desel and Wil van der Aalst Aggregating Causal Runs into Workflow</article-title>
          <string-name>
            <given-names>Nets.................................................... 36 Robin</given-names>
            <surname>Bergenthum</surname>
          </string-name>
          and
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Mauser Folding Partially Ordered</surname>
          </string-name>
          <string-name>
            <surname>Runs......................................................................... 52</surname>
          </string-name>
          <article-title>Philippe Darondeau and Laurie Ricker Towards Distributed Control of Discrete-Event</article-title>
          <string-name>
            <surname>Systems................................... 63</surname>
          </string-name>
          <article-title>Robin Bergenthum and Sebastian Mauser Mining with User</article-title>
          <string-name>
            <surname>Interaction.............................................................................. 79</surname>
          </string-name>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>