<!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 />
    <article-meta>
      <title-group>
        <article-title>Scenario-Based Modeling and Programming of Distributed Systems (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>FHDW Hannover</institution>
          ,
          <addr-line>30173 Hannover</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>241</fpage>
      <lpage>252</lpage>
      <abstract>
        <p>Software systems become increasingly distributed and interconnected. Single functions are usually realized by the interaction of multiple components, while single components participate in fulfilling multiple functions. During early development, engineers often design new functionalities by first taking an inter-component, interaction-oriented perspective, which must be mapped to a single-component implementation perspective later. This extended abstract reviews past and ongoing work on scenario-based modeling and programming techniques, which support engineers in this process. We also discuss new opportunities for applying these techniques as well as open research challenges.</p>
      </abstract>
      <kwd-group>
        <kwd>Scenario-Based Design</kwd>
        <kwd>Reactive Systems</kwd>
        <kwd>Behavioral Programming</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>From micro-services information systems to cyber-physical systems-of-systems,
software-intensive systems become increasingly distributed and interconnected.
In these systems, single functions are usually realized by the interaction of
multiple components, while single components often participate in fulfilling
multiple functions. During the design of these systems, engineers often first take a
birds-eye, inter-component view on how components shall interact in order to
fulfill a certain function. Typically sequence diagrams or interaction overview
diagrams are modeled during this phase to support design decision-making and
communication. At some stage, these inter-component models must be mapped
to specifications and, finally, implementations of the individual components.</p>
      <p>Scenario-based modeling techniques aim at supporting engineers in this
process. One goal of these techniques is to facilitate the transition from
intercomponent- to component-specific behavior specifications, and doing so
iteratively. The second goal is to support the engineer with behavior analysis
techniques already during the inter-component behavior modeling stage, so that
engineers can make more informed early design decisions.</p>
      <p>Copyright © 2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).</p>
      <p>In this extended abstract, we give a brief review of the existing work in this
context, with a pinch of personal experience and opinion. In particular, we cover
own past and current work on the Scenario Modeling Language (SML) and the
Scenario Modeling Language for Kotlin (SMLK), a Kotlin-based internal DSL for
scenario-based programming. Concluding, we discuss open research directions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Early research on scenario-based modeling was centered around Message
Sequence Charts (MSC) [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], which also influenced UML Sequence Diagrams. A
number of approaches suggested techniques for deriving state-based models from
individual MSCs [
        <xref ref-type="bibr" rid="ref31 ref39">31, 39</xref>
        ] and high-level MSCs [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ], which are MSCs extended
with control-flow constructs. Other approaches considered deriving state-based
models in a setting where multiple MSC diagrams could be active at the same
time [
        <xref ref-type="bibr" rid="ref29 ref34">29, 34</xref>
        ], and it was soon recognized that there needed to be a way to
describe constraints how scenarios are allowed to overlap. Some approaches used
event pre- and post-conditions [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ], others required the definition of the
component states within the scenarios [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ], temporal logic constraints [
        <xref ref-type="bibr" rid="ref37 ref38 ref4">4, 37, 38</xref>
        ]. or
proposed modeling positive and negative scenarios [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ].
      </p>
      <p>
        Addressing the problem of specifying overlapping scenarios, Damm and Harel
introduced Live Sequence Charts (LSC) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which recognized that there is a
difference between scenarios that should be possible to occur, and scenarios that
express rules on the behavior that must always be satisfied. These scenario kinds
are called existential resp. universal scenarios. Moreover, in universal scenarios
it should be possible to distinguish between events that must occur and events
that may occur or act as triggers for subsequent must-occur events. These are
called hot (must occur) resp. cold (may occur) events. Likewise, hot and cold
conditions can model mandatory- or interrupt conditions.
      </p>
      <p>
        Based on LSC, the Play-In/Play-Out approach was developed [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. with the
vision to interactively “play” with a system to teach it possible, allowed, or
forbidden behaviors, in the form of LSC diagrams. These LSC specification can then
be executed using the Play-Out algorithm. There were numerous approaches to
synthesize state-based models from LSC specifications [
        <xref ref-type="bibr" rid="ref2 ref20 ref32 ref33">2, 20, 32, 33</xref>
        ], and
checking whether this is at all possible; combinations of must-happen and
must-nothappen requirements can render LSC specifications unrealizable, meaning that no
implementation of the specification exists. Our own work included
realizabilitycheckig and synthesis techniques for timed LSC specifications [
        <xref ref-type="bibr" rid="ref10 ref18">10, 18</xref>
        ], and
LSCbased product line specifications [
        <xref ref-type="bibr" rid="ref12 ref19">12, 19</xref>
        ]. Also the Petri Nets community
suggested analysis techniques for LSCs, for example analyzing LSC specifications
by mapping to Colored Petri Nets (CPN) [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] or by a procedure for composing
Petri Nets from LSC-inspired Petri Net fragments [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        With Behavioral Programming (BP) [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], the idea of LSCs was transferred
to general-purpose programming languages, for example Java, JavaScript or
C++. BP allows programmers to program behavior by loosely coupled
behavioral threads (b-threads), where each b-thread can add behavior or constrain the
behavior of other b-threads, allowing for a flexible composition of behavior.
      </p>
    </sec>
    <sec id="sec-3">
      <title>Scenario</title>
    </sec>
    <sec id="sec-4">
      <title>Modeling Language (SML)</title>
      <p>With the goal of extending existing LSC modeling techniques and
experimenting with analysis algorithms, we developed the textual Scenario Modeling
Language (SML), along with the Eclipse/EMF-based tool suite ScenarioTools.
We chose a textual language for improved usability over a graphical notation.</p>
      <p>
        SML extends LSC with the capability to model assume/guarantee
specifications, where guarantee scenarios specify how a system must react to
environment events and assumption scenarios specify how the environment behaves.
This gives SML an expressive power comparable GR(1) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a subset of LTL. A
GR(1) specification is an implications of two generalized Büchi properties. For
example, we can specify that cars must always be able to pass crosswalks in a
traffic system assuming that each crosswalk is always eventually free of
pedestrians. ScenarioTools implements a GR(1) game solving algorithm [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] for
realizability checking and controller synthesis. Moreover, SML extends previous
LSC modeling techniques with features for modeling dynamic topology systems,
which are systems with evolving structure [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        Figure 1 shows an example of a Car-to-X system for coordinating cars that
approach an obstacle blocking one lane of a two-lane road. The left illustrates two
example scenarios with their SML counterpart shown on the right. SML
specifications are typed over a domain class model (top right). For a more extensive
description of SML and the example, we refer to the original paper [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>obsptaaapcsplseraooganechnlaiannrgeroobwstacle control baolpobpcsrktoaeacdclehlaionnnge
Scenario 1 “Dashboard of the car approaching
on the blocked lane shows STOP or GO”
obstacle control
before
obstacle is
reached</p>
      <p>3
approaching an obstacle 1
on the blocked lane</p>
      <p>2
show stop</p>
      <p>or go
Scenario 2 “Control station checks for car approaching
on the blocked lane whether entering is allowed or not”
is narrow area free? 3
(any car registered
for approach from
the other side?)</p>
      <p>entering
2 (Dis)Allowed
obstacle controlregister 4</p>
      <p>
        Based on ScenarioTools, we experimented with different analysis
techniques, for example symbolic execution [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], or automatic repair techniques [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ].
4
      </p>
    </sec>
    <sec id="sec-5">
      <title>Some Lessons Learned</title>
      <p>
        The work on ScenarioTools and various examples [
        <xref ref-type="bibr" rid="ref11 ref13 ref15 ref16">11, 13, 15, 16</xref>
        ] has taught
us several lessons:
1. LSC-/SML-style specification techniques indeed offer an intuitive way of
modeling reactive behavior. They are more flexible and requirements-oriented
than state-based models, but also more easily comprehensible than temporal
logics due to offering a more step-by-step modeling style.
2. Constructs that forbid behavior should be used sparingly and carefully, as
otherwise contradictions will be introduced easily. Strict messages (or hot
messages in LSC), which are messages that, when enabled, forbid events
appearing elsewhere in the scenario, are harmful in bigger scenarios, because
one quickly looses the understanding in what constraints they actually imply.
      </p>
      <p>It is better to specify forbidden messages explicitly.
3. Simulation and formal realizability checking techniques are helpful in finding
specification flaws. And specification flaws, just like bugs in other programs,
are guaranteed to be introduced sooner or later.
4. For complex problems, it is difficult to understand the output generated by
realizability checks. Even with interactive counter-play-out techniques that
help the user by simulation to understand how the environment can force a
violation, it may be difficult to understand the cause of the problem.
5. It is difficult to trust formal checks alone. Even if realizability checking
returns a positive result, it is often difficult to understand which behaviors are
or are not possible under the specification. The pragmatic approach is to
specify tests that exercise intended use cases beginning-to-end. We suggest a
test-driven approach, where scenarios are added just to a degree that satisfies
the next test case. This way, it is possible to arrive at a specification with
a trust that all use cases are covered. When changes break previous tests,
it is immediately clear what change affected which steps of which previous
use cases. Test-driven specification can be combined with realizability
checking. The latter may uncover problematic cases that are not covered by the
tests, for example untested combinations of inputs that lead to unforeseen
combinations of active scenarios.
5</p>
      <p>
        Scenario Modeling Language for Kotlin (SMLK)
Even though significant work went into building SML and tool support in
ScenarioTools, we felt that eventually these tool developments would not help to
make scenario-based modeling techniques better accepted in practice. SML and
ScenarioTools could not fulfill the following requirements:
1. Provide richer means for programming within the scenarios: For
example, doing things like filtering a list or querying complex conditions,
can be done with ScenarioTools, but only indirectly by calling external
methods. SML is extensible, but extending it to a fully-fledged programming
language would be a major effort.
2. Better integration with other libraries or frameworks: Integrating
the ScenarioTools execution engine with external frameworks, such as a
driving simulator or Android apps [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], is possible, but requires a
cumbersome development of integration layers.
3. Lightweight and fast execution: The ScenarioTools execution engine
is heavy-weight as it depends on EMF. Moreover, because the engine is based
on the interpretation of SML/EMF models, it has a relatively high memory
footprint and sometimes initial startup times of a few seconds.
      </p>
      <p>
        In addressing these requirements, we created an SML-like internal DSL in
Java [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], based on the behavioral programming framework for Java, BPJ [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
The approach, however, was too verbose. A few years later, Kotlin struck our
attention, mainly for two reasons: First, Kotlin supports co-routines, which are
lightweight threads that are less resource-intensive than Java threads.
Therefore, they seemed a natural candidate for executing many concurrent scenarios.
Second, Kotlin provides many features for building concise internal DSLs 1.
      </p>
      <p>
        Exploiting these features, we created the Scenario Modeling Language for
Kotlin (SMLK)2. In SMLK, multiple scenarios can be executed as a scenario
program. Following the behavioral programming approach [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] a scenario
program is executed as follows: The active scenarios execute their code
independently until they reach synchronization points where each scenario can requests,
wait-for or forbid events from happening. A central event selection algorithm
selects an event that is requested by at least one scenario and not forbidden by any
other scenario. All scenarios requesting or waiting for that event are then
notified and can again independently execute their behavior until reaching the next
synchronization point. This process is repeated until all scenarios terminate.
      </p>
      <p>Figure 2 shows an example of an SMLK scenario for a simple hierarchical
name lookup system: a client can send a request to a server to obtain the name
for a user ID. If the requested server does not have any name stored locally
for the given user ID, it will request servers one hierarchy level below. If one
of the servers has the name, it will be returned upwards in the hierarchy to
the requesting client. Otherwise the client receives an “unknown” response. The
shown scenario may be triggered for multiple servers in a server hierarchy.</p>
      <p>The client-server interaction illustration to the left of Fig. 2 is a screenshot
from a JavaFX-based interaction animator application that animates the
message interaction between objects3.
1 see for examplehttps://www.baeldung.com/kotlin/dsl
2 see https://bitbucket.org/jgreenyer/smlk/
3 the animator project Git repository: https://bitbucket.org/jgreenyer/
smlk-animator/; the hierarchical name lookup system example Git repository:
https://bitbucket.org/jgreenyer/smlk-animator-project-template/
scenavrailo(rSeeqruveesrt:i:nggeCtlUiseenrtNa=mei.ts.ysmebnodleircEavsenItCl(i)e)n{t:/ trigger: server receives getUserName req.</p>
      <p>val userID = it.parameters[0] as String
val server = it.receiver
val userName = server.userIDToUserNameProperty[userID]
if(userName := null){</p>
      <p>request(server sends requestingClient.serverResponse("$userID:$userName"))
}else{
for(slaveServer in server.slaveServers){
request(server sends slaveServer.getUserName(userID))
val responseEvent = waitFor(server receives IClient::serverResponse)
val responseValue = responseEvent.parameters[0] as String
if (!responseValue.endsWith("&lt;Unknown&gt;")) {</p>
      <p>request(server sends requestingClient.serverResponse(responseValue))
} } r}eque}st(tseerrmvienratsee(n)ds:r/edquoesntotingwCaliitefntor.sefruvrterheRerspsolnavsee(s"e$ruvseerrIrDe:s&lt;pUonnksneoswn&gt;"))</p>
      <p>
        SMLK integrates with JUnit and supports a test-driven scenario-specification
methodology [
        <xref ref-type="bibr" rid="ref42 ref44">42,44</xref>
        ] and combining inter-component scenarios with
componentspecific scenarios [
        <xref ref-type="bibr" rid="ref41 ref43">41, 43</xref>
        ].
      </p>
      <p>
        SMLK can also be used to specify traffic scenarios, similar to
OpenSCENARIO4 or Traffic Sequence Charts [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which are aimed at modeling tests for
autonomous vehicles. Figure 3 shows a composed SMLK scenario that specifies
a simple traffic scenario of one vehicle overtaking and then cutting a second
vehicle 5. Here, SMLK is integrated with SUMO; the box on the right of Fig. 3
shows snapshots of the resulting visual simulation output produced by SUMO.
      </p>
      <p>This example shall demonstrate the flexibility that SMLK offers in composing
such scenarios: The main scenario cutIn starts by waiting until the overtaking
vehicle approaches the second vehicle. This is performed by a sub-scenario
waitUntilDistanceSmallerThan that, as a parameter, can receive a scenario that
is executed in each step while waiting for the distance condition to render true.
Here, this is used to ensure that the overtaking vehicle is faster than the vehicle
to be overtaken. The distance is calculated by a sub-scenario getDistance that
waits for the vehicles’ position events, and then returns the difference.</p>
      <p>Of course, multiple such scenarios can be executed in parallel to direct and
coordinate the movement of many vehicles.
6 Conclusion and Open Research Challenges
We hope that we could provide an interesting, albeit self-biased, overview on the
past work on and current state of scenario-based modeling techniques. Further
4 https://www.asam.net/project-detail/asam-openscenario-v20-1/
5 inspired by https://releases.asam.net/OpenSCENARIO/1.0.0/ASAM_
OpenSCENARIO_BS-1-2_User-Guide_V1-0-0.html#_cut_in
waitUntilDistanceSmallerThan(overtakenVehicle, overtakingVehicle, overtakingDistance){
val overtakenVehicleSpeed = waitFor(overtakenVehicle.getSpeed()).result().!
request (overtakingVehicle.setSpeed(overtakenVehicleSpeed + overtakingSpeedDelta))
}
request(overtakingVehicle.changeLane(1))
waitUntilDistanceSmallerThan(overtakenVehicle, overtakingVehicle, passingDistance)
waitUntilDistanceGreaterThan(overtakenVehicle, overtakingVehicle, cutInDistance)
request(overtakingVehicle.changeLane(0))
accelerateVehicle(overtakingVehicle, slowSpeed, slowDownDuration, slowDuration)
}
}
}
...
suspend fun Scenario.waitUntilDistanceSmallerThan(
v1: SumoVehicle,
v2:SumoVehicle,
distance: Double,
nestedBehavior: suspend Scenario.() .&gt; Unit = {}) {
do {
val currentDistance = abs(getDistance(v1, v2))
nestedBehavior.invoke(this)
} while(currentDistance .= distance)
suspend fun Scenario.getDistance(v1: SumoVehicle, v2:SumoVehicle) : Double {
val executedEvents = unordered(
waitedForEvents = v1.getLanePosition() union v2.getLanePosition())</p>
      <p>
        as List&lt;ObjectEvent.*,*.&gt;
return executedEvents[0].result() as Double - executedEvents[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].result() as Double
...
...
...
research is yet required to evaluate and improve these techniques. We conclude
with a list of three interesting research directions:
1. Evaluation using larger-scale case studies: The existing literature of
scenario-based modeling/programming techniques only reports on small- and
medium-size case studies. It is time to exercise the development of more
complex distributed cyber-physical systems or micro-service systems in order
to reflect on the strengths and weaknesses of scenario-based techniques.
2. Improve realizability checking techniques and comprehensibility of
the results: We highlighted the benefit and problems of formal realizability
checking techniques. There are different ways in which these techniques could
be improved. For example, could synthesized strategies or counter-strategies
be presented to the user in more concise forms instead of producing huge
state graph models? Could program repair techniques be applied in order to
suggest scenario specification repairs if realizability checking fails?
3. Specify and simulate traffic scenarios for testing autonomous
systems: This seems a fitting area for applying scenario-based specification
techniques as they support a step-by-step operational description of what
shall happen in some places while also allowing for a more abstract,
nondeterministic specification of behavior elsewhere. Tailoring tests for
autonomous vehicles that effectively and efficiently test behaviors of interest and
support assessing residual risks [
        <xref ref-type="bibr" rid="ref25 ref35">25,35</xref>
        ] is a great challenge. Could controller
synthesis and learning techniques support test engineers in this process?
Acknowledgements The work on SML, ScenarioTools and the modeling and
analysis of dynamic topology systems was funded by grant no. 1258 of the
GermanIsraeli Foundation for Scientific Research and Development (GIF). The work was
the result of a fruitful collaboration notably with David Harel, Assaf Marron,
Shlomi Steinberg, Daniel Gritzner, Nils Glade, Timo Gutjahr, Florian König,
Eric Wete, Jianwei Shi, and Larissa Chazette. The work on test-driven scenario
specification employing SMLK is the result of a collaboration with Carsten
Wiecher. Integrating SMLK with SUMO for traffic system specifications was
supported by Maximilian Hölscher.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bloem</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jobstmann</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piterman</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pnueli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saar</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Synthesis of reactive(1) designs</article-title>
          .
          <source>J. Comput. Syst. Sci</source>
          .
          <volume>78</volume>
          (
          <issue>3</issue>
          ),
          <fpage>911</fpage>
          -
          <lpage>938</lpage>
          (May
          <year>2012</year>
          ). https://doi.org/10.1016/j.jcss.
          <year>2011</year>
          .
          <volume>08</volume>
          .007
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bontemps</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heymans</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schobbens</surname>
          </string-name>
          , P.Y.:
          <article-title>From live sequence charts to state machines and back: a guided tour</article-title>
          .
          <source>IEEE Transactions on Software Engineering</source>
          <volume>31</volume>
          (
          <issue>12</issue>
          ),
          <fpage>999</fpage>
          -
          <lpage>1014</lpage>
          (
          <year>2005</year>
          ). https://doi.org/10.1109/TSE.
          <year>2005</year>
          .137
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chatterjee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dvorák</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henzinger</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loitzenbauer</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Conditionally Optimal Algorithms for Generalized Büchi Games</article-title>
          . In: Faliszewski,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Muscholl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Niedermeier</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.) 41st
          <source>International Symposium on Mathematical Foundations of Computer Science (MFCS</source>
          <year>2016</year>
          ).
          <article-title>Leibniz IntProceedings in Informatics (LIPIcs)</article-title>
          , vol.
          <volume>58</volume>
          , pp.
          <volume>25</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>25</lpage>
          :
          <fpage>15</fpage>
          . Dagstuhl,
          <string-name>
            <surname>Germany</surname>
          </string-name>
          (
          <year>2016</year>
          ). https://doi.org/http://dx.doi.org/10.4230/LIPIcs.MFCS.
          <year>2016</year>
          .25
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Damas</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lambeau</surname>
          </string-name>
          , B.,
          <string-name>
            <surname>van Lamsweerde</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Scenarios, goals, and state machines: A win-win partnership for model synthesis</article-title>
          .
          <source>In: Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering</source>
          . p.
          <fpage>197</fpage>
          -
          <lpage>207</lpage>
          . SIGSOFT '06/FSE-14, Association for Computing Machinery, New York, NY, USA (
          <year>2006</year>
          ). https://doi.org/10.1145/1181775.1181800
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Damm</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Lscs:
          <article-title>Breathing life into message sequence charts</article-title>
          .
          <source>Formal Methods in System Design</source>
          <volume>19</volume>
          (
          <issue>1</issue>
          ),
          <fpage>45</fpage>
          -
          <lpage>80</lpage>
          (
          <year>Jul 2001</year>
          ). https://doi.org/10.1023/A:1011227529550
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Damm</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kemper</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Möhlmann</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peikenkamp</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rakow</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Using traffic sequence charts for the development of havs</article-title>
          .
          <source>In: European Congress on Embedded Real Time Software and Systems 2018. 9th European Congress on Embedded Real Time Software and Systems (ERTS</source>
          <year>2018</year>
          )
          <article-title>(</article-title>
          <year>2018</year>
          ), https://hal. archives-ouvertes.fr/hal-01714060/file/ERTS_2018_paper_17.pdf
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Fahland</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Oclets - scenario-based modeling with petri nets</article-title>
          . In: Franceschinis,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <surname>K</surname>
          </string-name>
          . (eds.)
          <source>Applications and Theory of Petri Nets, Lecture Notes in Computer Science</source>
          , vol.
          <volume>5606</volume>
          , pp.
          <fpage>223</fpage>
          -
          <lpage>242</lpage>
          . Springer Berlin Heidelberg (
          <year>2009</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -02424-5_
          <fpage>14</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Giese</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henkler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hirsch</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Nobody's perfect: Interactive synthesis from parametrized real-time scenarios</article-title>
          .
          <source>In: Proceedings of the 2006 International Workshop on Scenarios and State Machines: Models</source>
          , Algorithms, and Tools. p.
          <fpage>67</fpage>
          -
          <lpage>74</lpage>
          . SCESM '
          <volume>06</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA (
          <year>2006</year>
          ). https://doi.org/10.1145/1138953.1138967
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Giese</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tissen</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The SceBaSy Plugin for the Scenario-Based Synthesis of Real-Time Coordination Patterns for Mechatronic UML</article-title>
          .
          <source>In: Proceedings of the 3rd International Fujaba Days</source>
          <year>2005</year>
          , Paderborn, Germany (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Greenyer</surname>
          </string-name>
          , J.:
          <source>Scenario-based Design of Mechatronic Systems. Ph.D. thesis</source>
          , University of Paderborn, Paderborn (
          <year>October 2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bar-Sinai</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sadon</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Modeling and programming a leader-follower challenge problem with scenario-based tools</article-title>
          . In: Hebig,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Berger</surname>
          </string-name>
          , T. (eds.)
          <source>Proceedings of MODELS 2018 Workshops co-located with ACM/IEEE 21st International Conference on Model Driven Engineering Languages and Systems (MODELS</source>
          <year>2018</year>
          ), Copenhagen, Denmark, October,
          <volume>14</volume>
          ,
          <year>2018</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2245</volume>
          , pp.
          <fpage>376</fpage>
          -
          <lpage>385</lpage>
          . CEUR (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brenner</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cordy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heymans</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gressi</surname>
          </string-name>
          , E.:
          <article-title>Incrementally synthesizing controllers from scenario-based product line specifications</article-title>
          .
          <source>In: Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering</source>
          . p.
          <fpage>433</fpage>
          -
          <lpage>443</lpage>
          . ESEC/FSE 2013,
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA (
          <year>2013</year>
          ). https://doi.org/10.1145/2491411.2491445
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chazette</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gritzner</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wete</surname>
          </string-name>
          , E.:
          <article-title>A scenario-based MDE process for dynamic topology collaborative reactive systems - early virtual prototyping of Car-to-X system specifications</article-title>
          . In: Schaefer,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Cleophas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Felderer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Becker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Böhm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Fahland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Fill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Kirchner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Köhler-Bußmeier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Konersmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Mayr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.C.</given-names>
            ,
            <surname>Moldt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Oberweis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Reher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Riebisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Sauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Schlingloff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Thalheim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Vogelsang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Weißbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Weyer</surname>
          </string-name>
          , T. (eds.)
          <article-title>Proceedings Workshops zur Modellierung in der Entwicklung von kollaborativen eingebetteten Systemen (MEKES)</article-title>
          ,
          <source>Joint Proceedings of the Workshops co-located with Modellierung</source>
          <year>2018</year>
          , Braunschweig, Germany, February
          <volume>21</volume>
          ,
          <year>2018</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <year>2060</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>120</lpage>
          . CEUR-WS.org (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gritzner</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Katz</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Scenario-based modeling and synthesis for reactive systems with dynamic system structure in ScenarioTools</article-title>
          . In: de Lara, J.,
          <string-name>
            <surname>Clarke</surname>
            ,
            <given-names>P.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sabetzadeh</surname>
          </string-name>
          , M. (eds.)
          <source>Proceedings of the MoDELS 2016 Demo and Poster Sessions, co-located with ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems (MoDELS</source>
          <year>2016</year>
          ). vol.
          <volume>1725</volume>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>32</lpage>
          . CEUR (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gritzner</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Katz</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glade</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutjahr</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>König</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Distributed execution of scenario-based specifications of structurally dynamic cyber-physical systems</article-title>
          .
          <source>Procedia Technology (Proceedings of the 3nd International Conference on System-Integrated Intelligence: Challenges for Product and Production Engineering</source>
          , SysInt
          <year>2016</year>
          )
          <article-title>(2016), 3rd International Conference on System-Integrated Intelligence: Challenges for Product and Production Engineering (SysInt</article-title>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gritzner</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wete</surname>
          </string-name>
          , E.:
          <article-title>A scenario-based MDE process for developing reactive systems: A cleaning robot example</article-title>
          . In: Burgueño,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Corley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Bencomo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Clarke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.J.</given-names>
            ,
            <surname>Collet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Famelis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Gogolla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Greenyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Guerra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Kokaly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Pierantonio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Rubin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Ruscio</surname>
          </string-name>
          , D.D. (eds.)
          <source>Proceedings of MODELS 2017 Satellite Events, co-located with ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS</source>
          <year>2017</year>
          ).
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <year>2019</year>
          , pp.
          <fpage>71</fpage>
          -
          <lpage>80</lpage>
          . CEUR (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutjahr</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Symbolic execution for realizability-checking of scenariobased specifications</article-title>
          .
          <source>In: 2017 ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)</source>
          . pp.
          <fpage>312</fpage>
          -
          <lpage>322</lpage>
          (
          <year>2017</year>
          ). https://doi.org/10.1109/MODELS.
          <year>2017</year>
          .35
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kindler</surname>
          </string-name>
          , E.:
          <article-title>Compositional synthesis of controllers from scenariobased assume-guarantee specifications</article-title>
          . In: Moreira,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Schätz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Gray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Vallecillo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Clarke</surname>
          </string-name>
          , P. (eds.) Model-Driven
          <source>Engineering Languages and Systems: Proceedings of the ACM/IEEE 16th International Conference (MODELS 2013), Lecture Notes in Computer Science</source>
          , vol.
          <volume>8107</volume>
          , pp.
          <fpage>774</fpage>
          -
          <lpage>789</lpage>
          . Springer Berlin Heidelberg (
          <year>2013</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -41533-3_
          <fpage>47</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Molzam</surname>
            <given-names>Sharifloo</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Cordy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Heymans</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Features meet scenarios: modeling and consistency-checking scenario-based product line specifications</article-title>
          .
          <source>Requirements Engineering</source>
          <volume>18</volume>
          (
          <issue>2</issue>
          ),
          <fpage>175</fpage>
          -
          <lpage>198</lpage>
          (
          <year>2013</year>
          ). https://doi.org/10.1007/s00766- 013-0169-4, http://dx.doi.org/10.1007/s00766-013-0169-4
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Harel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kugler</surname>
          </string-name>
          , H.:
          <article-title>Synthesizing state-based object systems from LSC specifications</article-title>
          .
          <source>Foundations of Computer Science</source>
          <volume>13</volume>
          :
          <issue>1</issue>
          ,
          <fpage>5</fpage>
          -
          <lpage>51</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Harel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marelly</surname>
          </string-name>
          , R.: Come,
          <article-title>Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine</article-title>
          . Springer (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Harel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
          </string-name>
          , G.:
          <article-title>Programming coordinated behavior in java</article-title>
          . In:
          <string-name>
            <surname>D'Hondt</surname>
            ,
            <given-names>T</given-names>
          </string-name>
          . (ed.)
          <article-title>ECOOP 2010 - Object-Oriented Programming</article-title>
          . pp.
          <fpage>250</fpage>
          -
          <lpage>274</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2010</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -14107-2_
          <fpage>12</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Harel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
          </string-name>
          , G.:
          <article-title>Behavioral programming</article-title>
          .
          <source>Comm. ACM</source>
          <volume>55</volume>
          (
          <issue>7</issue>
          ),
          <fpage>90</fpage>
          -
          <lpage>100</lpage>
          (
          <year>2012</year>
          ). https://doi.org/10.1145/2209249.2209270
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Haugen</surname>
          </string-name>
          , Ø.,
          <string-name>
            <surname>Husa</surname>
            ,
            <given-names>K.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Runde</surname>
            ,
            <given-names>R.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stølen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>STAIRS towards formal design with sequence diagrams</article-title>
          .
          <source>Software &amp; Systems Modeling</source>
          <volume>4</volume>
          (
          <issue>4</issue>
          ),
          <volume>355</volume>
          (Oct
          <year>2005</year>
          ). https://doi.org/10.1007/s10270-005-0087-0
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Hollander</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Estimating the residual risk of adas / av (</article-title>
          <year>Feb 2021</year>
          ), https://blog. foretellix.com/
          <year>2021</year>
          /02/01/
          <article-title>estimating-the-residual-risk-of-adas-av/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26. ITU:
          <string-name>
            <surname>ITU-TS</surname>
          </string-name>
          Recommendation Z.
          <volume>120</volume>
          :
          <string-name>
            <surname>Message</surname>
            <given-names>Sequence Charts (MSC</given-names>
          </string-name>
          ) (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Khadka</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolajczak</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Transformation from live sequence charts to colored petri nets</article-title>
          .
          <source>In: Proceedings of the 2007 Summer Computer Simulation Conference</source>
          . p.
          <fpage>673</fpage>
          -
          <lpage>680</lpage>
          . SCSC '
          <volume>07</volume>
          ,
          <string-name>
            <surname>Society</surname>
          </string-name>
          for Computer Simulation International, San Diego, CA, USA (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>König</surname>
            ,
            <given-names>F.W.H.</given-names>
          </string-name>
          :
          <article-title>Szenariobasierte Programmierung und verteilte Ausführung in Java</article-title>
          .
          <source>Master's thesis</source>
          , Leibniz Universität Hannover, Software Engineering Group (
          <year>2017</year>
          ), http://jgreen.de/wp-content/documents/msc-theses/
          <year>2017</year>
          / Koenig2017.pdf
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Koskimies</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Systa</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tuomi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannisto</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Automated support for modeling OO software</article-title>
          .
          <source>IEEE Software 15(1)</source>
          ,
          <fpage>87</fpage>
          -
          <lpage>94</lpage>
          (
          <year>1998</year>
          ). https://doi.org/10.1109/52.646888
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Krüger</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Distributed System Design with Message Sequence Charts</article-title>
          .
          <source>Ph.D. thesis</source>
          , Technische Universität München,
          <source>Institut für Informatik</source>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Krüger</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grosu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scholz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Broy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>From MSCs to statecharts</article-title>
          .
          <source>In: DIPES '98: Proceedings of the IFIP WG10.3/WG10.5 International Workshop on Distributed and Parallel Embedded Systems</source>
          . pp.
          <fpage>61</fpage>
          -
          <lpage>71</lpage>
          . Kluwer Academic Publishers, Norwell, MA, USA (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Kugler</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plock</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pnueli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Controller synthesis from LSC requirements</article-title>
          . In: Chechik,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Wirsing</surname>
          </string-name>
          , M. (eds.)
          <source>Proceedings of the 12th International Conference of Fundamental</source>
          Approaches to Software Engineering,
          <string-name>
            <surname>FASE</surname>
          </string-name>
          <year>2009</year>
          ,
          <article-title>Held as Part of the Joint European Conferences on Theory and Practice of Software</article-title>
          ,
          <source>ETAPS</source>
          <year>2009</year>
          , York, UK, March
          <volume>22</volume>
          -29,
          <year>2009</year>
          . Lecture Notes in Computer Science, vol.
          <volume>5503</volume>
          , pp.
          <fpage>79</fpage>
          -
          <lpage>93</lpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Kugler</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Segall</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications</article-title>
          .
          <source>In: Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS</source>
          <year>2009</year>
          ,
          <article-title>Held as Part of the Joint European Conferences on Theory and Practice of Software</article-title>
          ,
          <source>ETAPS</source>
          <year>2009</year>
          , York, UK, March
          <volume>22</volume>
          -29,
          <year>2009</year>
          . pp.
          <fpage>77</fpage>
          -
          <lpage>91</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Maier</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zündorf</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The Fujaba Statechart Synthesis Approach</article-title>
          .
          <source>In: Proceedings of the 2nd International Workshop on Scenarios and State Machines: Models</source>
          , Algorithms, and Tools,
          <string-name>
            <surname>ICSE</surname>
          </string-name>
          <year>2003</year>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Neurohr</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Westhofen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Butz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bollmann</surname>
            ,
            <given-names>M.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eberle</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galbas</surname>
          </string-name>
          , R.:
          <article-title>Criticality analysis for the verification and validation of automated vehicles</article-title>
          .
          <source>IEEE Access 9</source>
          ,
          <fpage>18016</fpage>
          -
          <lpage>18041</lpage>
          (
          <year>2021</year>
          ). https://doi.org/10.1109/ACCESS.
          <year>2021</year>
          .3053159
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Schmelter</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holtmann</surname>
          </string-name>
          , J.:
          <article-title>Toward learning realizable scenariobased, formal requirements specifications</article-title>
          .
          <source>In: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</source>
          ,
          <source>4th International Workshop on Artificial Intelligence for Requirements Engineering (AIRE)</source>
          . pp.
          <fpage>372</fpage>
          -
          <lpage>378</lpage>
          (
          <year>Sept 2017</year>
          ). https://doi.org/10.1109/REW.
          <year>2017</year>
          .14
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Uchitel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brunet</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chechik</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Behaviour Model Synthesis from Properties and Scenarios</article-title>
          .
          <source>In: Proceedings of the 29th international Conference on Software Engineering, ICSE '07</source>
          . pp.
          <fpage>34</fpage>
          -
          <lpage>43</lpage>
          . IEEE Computer Society, Washington, DC, USA (
          <year>2007</year>
          ). https://doi.org/http://dx.doi.org/10.1109/ICSE.
          <year>2007</year>
          .21
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Uchitel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brunet</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chechik</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Synthesis of Partial Behavior Models from Properties and Scenarios</article-title>
          .
          <source>IEEE Transactions on Software Engineering</source>
          <volume>35</volume>
          (
          <issue>3</issue>
          ),
          <fpage>384</fpage>
          -
          <lpage>406</lpage>
          (
          <year>2009</year>
          ). https://doi.org/10.1109/TSE.
          <year>2008</year>
          .107
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Uchitel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kramer</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A Workbench for Synthesising Behaviour Models from Scenarios</article-title>
          .
          <source>In: Proceedings of the 23rd International Conference on Software Engineering</source>
          ,
          <string-name>
            <surname>ICSE</surname>
          </string-name>
          <year>2001</year>
          . pp.
          <fpage>188</fpage>
          -
          <lpage>197</lpage>
          (
          <year>2001</year>
          ). https://doi.org/10.1109/ICSE.
          <year>2001</year>
          .919093
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Whittle</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schumann</surname>
          </string-name>
          , J.:
          <article-title>Generating statechart designs from scenarios</article-title>
          .
          <source>In: Proceedings of the 22nd international conference on Software engineering, ICSE '00</source>
          . pp.
          <fpage>314</fpage>
          -
          <lpage>323</lpage>
          (
          <year>2000</year>
          ). https://doi.org/10.1109/ICSE.
          <year>2000</year>
          .870422
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Wiecher</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenyer</surname>
          </string-name>
          , J.:
          <article-title>Besos: A tool for behavior-driven and scenariobasedrequirements modeling for systems of systems</article-title>
          . In: Aydemir,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Gralha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Abualhaija</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Breaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Daneva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ernst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Ferrari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Franch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Ghanavati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Groen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Guizzardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Herrmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Horkoff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Mennig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Paja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Perini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Seyff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Susi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Vogelsang</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Joint Proceedings of REFSQ-2021 Workshops</source>
          , OpenRE,Posters and
          <string-name>
            <given-names>Tools</given-names>
            <surname>Track</surname>
          </string-name>
          , and Doctoral Symposium, Essen, Germany,
          <fpage>12</fpage>
          -
          <lpage>04</lpage>
          -
          <fpage>2021</fpage>
          . CEUR Workshop Proceedings, vol.
          <volume>2857</volume>
          .
          <string-name>
            <surname>CEUR</surname>
          </string-name>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Wiecher</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Korte</surname>
          </string-name>
          , J.:
          <article-title>Test-driven scenario specification of automotive software components</article-title>
          .
          <source>In: The 2nd International Workshop on Modeling in Automotive Software Engineering, Proceedings of MODELS</source>
          <year>2019</year>
          <article-title>Workshops (to appear), co-located with</article-title>
          <source>ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems (MODELS</source>
          <year>2019</year>
          ), Munich, Germany,
          <year>September 2019</year>
          . CEUR Workshop Proceedings, CEUR (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Wiecher</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anacker</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumitrescu</surname>
          </string-name>
          , R.:
          <article-title>Iterative and scenario-based requirements specification in a system of systems context</article-title>
          . In: Dalpiaz,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Spoletini</surname>
          </string-name>
          , P. (eds.) Requirements Engineering:
          <article-title>Foundation for Software Quality (REFSQ</article-title>
          <year>2021</year>
          ). pp.
          <fpage>165</fpage>
          -
          <lpage>181</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Wiecher</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Japs</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenyer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumitrescu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Scenarios in the loop: Integrated requirements analysis and automotive system validation</article-title>
          .
          <source>In: Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings. MODELS '20</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA (
          <year>2020</year>
          ). https://doi.org/10.1145/3417990.3421264
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>