<!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>A formalization of Ashok Goel's SBF concept of function</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stefano Borgo</string-name>
          <email>stefano.borgo@cnr.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Massimiliano Carrara</string-name>
          <email>massimiliano.carrara@unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pawel Garbacz</string-name>
          <email>garbacz@kul.lublin.pl</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pieter E. Vermaas</string-name>
          <email>p.e.vermaas@tudelft.nl</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>FISPPA Department</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Laboratory of Applied Ontology, ISTC CNR</institution>
          ,
          <addr-line>Trento</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Philosophy Department, Delft University of Technology</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Philosophy Department, John Paul II Catholic University of Lublin</institution>
          ,
          <country country="PL">Poland</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Section of Philosophy, University of Padua</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We formalize within the dolce foundational ontology the Structure-Behavior-Function model (sbf) proposed by Ashok K. Goel and colleagues. Our work focuses in particular on the notion of function. This work on sbf is part of a larger project that includes the formalization of the concepts of function by Chandrasekaran and Josephson and by Stone and Wood. The overall goal is to make engineering functional descriptions of technical artifacts based on di erent concepts of function, exchangeable by separately formalizing these di erent concepts in a single ontological framework. The formalization is a necessary step towards the development of an integrated information system for engineering design.</p>
      </abstract>
      <kwd-group>
        <kwd>function</kwd>
        <kwd>formal ontology</kwd>
        <kwd>sbf model</kwd>
        <kwd>Ashok K</kwd>
        <kwd>Goel</kwd>
        <kwd>dolce</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The aim of this contribution is to formalize the concept of function of technical
artifacts as advanced by Ashok K. Goel and his colleagues [10] as part of the
Structure-Behavior-Function (sbf) model. The sbf concept of function is
developed in [10, pp. 25-26], [11] from the so-called Functional Representation (fr)
approach towards modeling functions, proposed by Chandrasekaran and
Josephson [8]. The sbf model extends this original modeling, for instance, by describing
the structure of technical artifacts in terms of components and substances, and
by adding the assumption that there exists a limited set of primitive functions.</p>
      <p>Given the relationship between the sbf model and the fr approach we
arrive at a formalization of the sbf concept of function using as a starting point
our earlier formalization of the fr approach. The formalization of sbf functions
includes also formal characterizations of the sbf concepts of structure and
behavior: we take a behavior in sbf to be a discrete sequence of states, and an
sbf function to be an sbf behavior with a xed input state and a xed
output state, both speci ed by a set of values for state parameters (pre-conditions
and post-conditions). An sbf function is then formalized as constraints on these
parameters of states.</p>
      <p>A central starting point in our larger project is to formalize all engineering
concepts of function within the same ontology, seen as a unifying structure for
the analysis and the formalization of these concepts, namely the Descriptive
Ontology for Linguistic and Cognitive Engineering (dolce) [12].</p>
      <p>The paper opens in section 1 with a brief description of our larger project.
Section 2 outlines the central concepts of dolce. Then, in Section 3, we describe
the sbf model in some detail and relate it with the fr approach. In section 4
we focus on the formalization of the sbf concept of function.
1</p>
    </sec>
    <sec id="sec-2">
      <title>The larger project</title>
      <p>This work on sbf functions is part of a larger project aimed at making
engineering functional descriptions of technical artifacts (based on di erent concepts of
function) interoperable. This is obtained by separately formalizing the main
different concepts within a single ontological framework. The approach is described
and argued for in [5]:
[It] does not aim directly at a single concept of function, but tries to
reconstruct the main meanings that engineers attach to this term by means
of a series of formalizations within one single formal framework. In this
strategy one focuses still on well-de ned and speci c concepts of
function, which are taken as classical concepts, but now di erent [meanings]
of such concepts are formalized. [It] is also in conformance with
engineering practice by describing and formalizing the concepts of function
used. [. . . ] Yet this [. . . ] strategy disambiguates functional descriptions
only in a weak sense. Each meaning that is formalized on this strategy
is analyzed in detail, assessed for consistency, and if needed at points
corrected. And if such corrections are not feasible, particular meanings
may even be discarded as untenable ones [. . . ]. Yet, after formalization
it still amounts to di erent concepts of function that co-exist in one
formal system. By their co-existence in one formal system, these functional
concepts may be compared and related, just as any other set of concepts
can be compared and related. [. . . ] [5, p. 152]
In our larger project we thus accept the co-existence of di erent meanings of
function as a feature of engineering [15], and proceed by formalizing those di
erent meanings. In [1] we formalized the concept of function by Chandrasekaran
and Josephson [8], which represents the fr approach towards modeling functions.
In [2] we formalized the Stone and Wood [14] concept of functions, representing
the fb modeling approach. And in [9] we provided a formal comparison between
these two formalizations and showed how automatic exchange of functional
descriptions originating in these approaches may look like. With this contribution
we proceed in our project by including a formalization of Goel's sbf concept of
function.
2
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>A very brief introduction to DOLCE</title>
      <sec id="sec-3-1">
        <title>The general structure of DOLCE</title>
        <p>Dolce is a foundational ontology of particulars with a clear cognitive bias since
its categories are obtained by analyzing the surface structure of language and
cognition. Consequences of this approach are that dolce's categories are at the
so-called mesoscopic level, the level of the middle-sized objects we, as humans,
perceive. The Dolce's taxonomic structure is pictured in Figure 1. Each node in
the graph is a category of the ontology. A category that is a direct subcategory
of another is depicted by drawing the latter higher in the graph and linking them
with an edge. Particular is the top category. The set of direct subcategories
of a given category forms a partition unless dots are inserted.</p>
        <p>PT</p>
        <p>Particular
PED
Physical
Endurant</p>
        <p>ED
Endurant</p>
        <p>NPED
Non-physical
Endurant</p>
        <p>PD
Perdurant</p>
        <p>Q
Quality</p>
        <p>AB
Abstract</p>
        <p>AS
Arbitrary
Sum</p>
        <p>EV
Event</p>
        <p>STV
Stative</p>
        <sec id="sec-3-1-1">
          <title>TQemuTapQloitryal PQhuPyasQliictyal AQbuAsatQrlaityct</title>
          <p>… Fact Set RegRion</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>AmMoaMuttnetrof FeaFture POhPbyOsjeiBccatl … NonON-pbPhjOeycBstical AchiAevCeHment AccomApCliCshment SStaTte PrPoRcOess …TLeomcTapLtoioranl L…SopcSaaLttiiaoln …</title>
        </sec>
        <sec id="sec-3-1-3">
          <title>TRemeTgpRioornal PRheyPgsRiiocnal ARbesAgtRrioanct</title>
          <p>…
…
…
…
APO
Agentive
Physical
Object</p>
          <p>NAPO
Non-agentive
Physical
Object</p>
          <p>MOB SOB
Mental Object Social Object
… T</p>
          <p>Time
Interval
…SpSace …
Region
ASO
Agentive
Social Object</p>
          <p>NASO
Non-agentive</p>
          <p>Social Object
SociaSAlAGgent</p>
          <p>SC</p>
          <p>Society</p>
          <p>The dolce ontology category endurant comprises objects, e.g., a hammer,
and amounts of matter, e.g., the amount of water in this glass, the amount of gold
in my wedding ring, while the category perdurant comprises events like making
a hole or a soccer game, that is, things that happen in time. The term `object' is
used in the ontology to capture a notion of unity as suggested by the partition
of the class physical endurant into classes amount of matter, feature,
and physical objects (see Figure 1). Among those we need to explain in more
detail the dolce notion of feature. In dolce, features are dependent entities
which are wholes, thus distinguished from individual qualities:</p>
          <p>Typical examples of features are \parasitic entities" such as holes,
boundaries, surfaces, or stains, which are generically constantly
dependent on physical objects (their hosts). All features are essential wholes,
but, as in the case of objects, no common unity criterion may exist for
all of them. However, typical features have a topological unity, as they
are singular entities. Some features may be relevant parts of their host,
like a bump or an edge, or places like a hole in a piece of cheese, the
underneath of a table, the front of a house, which are not parts of their
host. [12, p. 16]
2.2</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>DOLCE categories and relations we focus on</title>
        <p>In this section we present the categories of dolce in Figure 1 that are relevant
to our work. Note that the terminology adopted departs sometimes from that
in engineering design, knowledge representation, and conceptual modeling since
a ected in part by the philosophical literature.</p>
        <p>ED(x) stands for \x is an endurant". An endurant is an entity that is wholly
present at any time it is present. It is physical if located in space and time: a
hammer #321, a mover machine #111, an amount of plastic, and the cavity in
which a piston moves.</p>
        <p>PED(x), a subcategory of ED, stands for \x is a physical endurant. A hammer,
a mover machine, an amount of plastic, and the cavity in which a piston moves,
are all examples of physical endurants. We will use two subcategories of physical
endurants: physical objects POB and features F.</p>
        <p>NPED(x) stands for \x is a non-physical endurant." NPED is a subcategory of
ED that includes mental objects, e.g., beliefs, intentions, etc., and social objects
(SOB), e.g., norms, shares, peace treaties.</p>
        <p>PD(x) stands for \x is a perdurant", i.e., an entity that is only partially
present at any time that is present. For instance, consider the perdurant
producing an item of type #234 that consists of riveting two metal pieces and painting
the resulting piece. While the painting goes on, the (temporal) part
corresponding to riveting is no longer present and when this is present, the painting still has
to come. We will use also the basic distinction between events (EV) and states
(ST) among perdurants. A perdurant is stative or eventive according to whether
it holds of the mereological sum of two of its instances, i.e., if it is cumulative
or not. A sitting is a state since the sum of two sittings is still a sitting, while a
sitting down is an event since the sum of two sitting downs is not a sitting down.</p>
        <p>Among the ontological relations in dolce we will make use of the parthood
relation: \x is part of y", written P(x,y). The formal theory based on parthood
is called mereology [13]. In dolce the parthood relation applies to pairs of
endurants and to pairs of perdurants. For instance, if a = `writing article A' and
b = `writing the introduction to article A', then P(b,a) holds. For endurants,
the relation of parthood is temporalized since an endurant may loose and gain
parts throughout its existence: P(e; e0; t) says that the endurant e is part of the
endurant e0 at the instant or interval t. In the setting of sbf holds the
simplifying assumption that the time interval is xed: consequently, the temporal
relativization of mereological parthood between endurants is here neglected.</p>
        <p>A number of auxiliary de nitions, like proper part, overlap and sum, can be
introduced from P . (Symbol , indicates a de nition.)</p>
        <p>
          PP(x; y) , P(x; y) ^ :P(y; x)
A perdurant is a proper part (P P ) of another if it is part of the second and not
vice versa. Example: Reading this section is a proper part of reading the paper.
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
        </p>
        <p>
          O(x; y) , 9z(P(z; x) ^ P(z; y))
Two perdurants overlap (O) if a perdurant exists which is simultaneously part of
both. Example: `My drinking on the couch' and `my watching TV on the couch'
have `my sitting on the couch' as part of both. Regarding mereological sum (+),
a perdurant z is the sum of x and y provided that x, y are parts of z, and that
whatever overlaps z also overlaps x or y. Formally,
x + y , z 8w(O(w; z) $ (O(w; x) _ O(w; y)))
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
This de nition can be easily extended for ternary, quaternary, etc., operations.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Functions in the SBF model and in the fr approach</title>
      <p>Here we report the terminology from [10] and connect the concepts used in the
sbf model and the concepts advanced in the fr approach. In Section 4, when we
formalize sbf concepts, we add more details to the description of these concepts.</p>
      <p>An sbf model of an artifact includes submodels of the artifact's structure,
behavior and function. These submodels are characterized as follows:</p>
      <p>The structural submodel of an artifact consists of a description of the
elements of the artifact and the connections between these elements. In these
structural models a distinction is made between elements that are components and
elements that are substances. The connections between components are called
connecting points.</p>
      <p>The behavioral submodel captures the behavior of an artifact in terms of
transitions between states of the artifact, where these states refer to properties
of the connecting points of the artifact, that is, of the artifact's structure. The
behavioral submodel moreover gives causal explanations of these transitions.</p>
      <p>Finally, sbf functions describe the role an element in an artifact plays in the
operation of the artifacts; an sbf function gives a purpose of the element and
refers to a behavior by which the element realises the purpose. Some primitive
functions are listed, e.g., `create', `destroy', `expel', `allow', `pump' and `move'.</p>
      <p>Let us now bring in the fr approach as described in [8]. In this approach
the term behavior is undestood to have ve engineering meanings and the term
function to have two. The meanings of behavior are characterized with the help
of the primitive notion of state variable (the examples are from [8]):
1. the value of some state variable of the artifact or a relation between such
values at a particular instant.
2. the value of a property of the artifact or a relation between such values.
3. the value of some state variable of the artifact over an interval of time.
4. the value of some output state variable of the artifact at a particular instant
or over an interval.
5. the values of all the described state variables of the artifact at a particular
instant or over an interval.</p>
      <p>Note that for all meanings, a behavior of a technical artifact is in part objective
and in part subjective. Objective because it eventually depends on the
properties or features of the artifact. Still, the very same behavior depends on the
designer(s) and, indirectly, on engineering practice for the choice of the variables.</p>
      <p>The two meanings of function in the fr approach are called device-centric
and environment-centric meanings. A device-centric function of an artifact is a
behavior of the artifact that is selected and intended by some agent. The function
is described in terms of the properties and behaviors of the artifact only; an
example is \making sound" in the case of an electric buzzer. An
environmentcentric function is in turn an e ect or impact of this behavior of the artifact
on its environment provided this e ect or impact is selected and intended by
some agent. This kind of function is conceptually separated from the artifact
that performs or is expected to perform this function; \enabling a visitor to a
house to inform the person inside the house that someone is at the door" is an
environment-centric function of the buzzer.</p>
      <p>When comparing the concepts advanced in the sbf model and the fr
approach, it can be noted that the notions of behavior are fairly similar. Moreover,
functions are derived notions in both: functions give the agent's viewpoint on
behaviors although agents are only implicit in the sbf framework.</p>
      <p>In a nutshell: in sbf and in fr functions provide the purpose of an entity in a
given situation while the entity's behavior is the way the purpose is accomplished.
The distinction device-centric and environment-centric functions is not part of
sbf. Here, we will consider the sbf concept of function as typically an fr
devicecentric function, since { as we will see { sbf functions refer to sbf behaviors
and purposes of components that are typically described in terms of properties
of the artifact itself, a speci cation given in fr to device-centric functions.</p>
      <p>
        As concerns behavior : in fr the behavior of a technical artifact is the speci c
way in which the artifact occurs in an event, it is speci ed by the meanings (
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1-5</xref>
        )
given above, and characterized using the primitive notion of state variable; in
sbf behavior is also conceived as a speci c way in which a technical artifact
occurs in an event. Di erently from fr, in sbf there is an emphasis on the
state-transition construction of behaviors.
      </p>
      <p>Finally, the notion of structure is in sbf somewhat more complex than in fr
since there is in sbf, and not in fr, a basic distinction between the elements of
a device and the connections between the elements.</p>
    </sec>
    <sec id="sec-5">
      <title>Formalizing SBF Functions</title>
      <p>We now develop the formalization of the sbf model starting from our previous
work on the fr approach [1], and then extend it to cover the sbf system including
the notion of function. The notion of technical artifact (or device) is introduced
in sbf without a speci c characterization as it happens in fr and the notion of
behavior is developed from similar assumptions. Note, however, that the di erent
setting of sbf will later lead us to make some alternative formalization choices.</p>
      <p>We identi ed the following main categories of sbf
{ (technical) device and its physical components
{ substances
{ connections and connection points
{ devices' states and behaviors
{ functions</p>
      <p>Following the methodology described in [5] we rst align these categories to
the dolce taxonomy.
4.1</p>
      <p>Ontological categorization
sbf uses a notion of device which is richer than that exploited by fr. sbf can
describe to some extent the structure of the device itself. In particular, a basic
distinction is set between elements (parts) of the device and connections among
them. Elements are clearly divided in: a) physical components, i.e., the physical
parts of a device, and b) substances, like uids and forces. Ontologically these
entities are dolce's endurants ( stands for the exclusive disjunction):
Elem(x) ! PhComp(x)</p>
      <p>Subst(x)</p>
      <p>Elem(x) ! ED(x)
More speci cally, a physical component is a rigid or semi-rigid material object
of a subclass (called RigidPOB) of physical objects (POB). We do not attempt
to constrain this class here since the distinction is not clari ed by the authors
and does not play a role in the system. A substance can be characterized as
an amount of matter (M) or a non-physical endurant (NPED), although not a
NPOB, i.e., it is neither a mental nor a social object.</p>
      <p>PhComp(x) ! RigidPOB(x)</p>
      <p>RigidPOB(x) ! POB(x)</p>
      <p>Subst(x) ! M(x) _ [NPED(x) ^ :NPOB(x)]
Components, and not substances, may have connection points (ConnPt) with
which to be connected to other components. In dolce these connection points
are classi ed as features (F):</p>
      <p>
        ConnPt(x) ! F(x)
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
Two connection points in two components can be connected. There is a xed
number of possible connection types depending on how force can be transferred
across the connection points: parallel, series, touching, adjoining, bolted, fused,
hinged, jointed, tied, telescoped, threaded, frictionally embedded, sewn, nailed,
clipped, ball&amp;socket installed and glued. Since connections are relationships
needed to discuss force transfer or lack of it, in dolce we look at their
temporal behavior and classify them in the category of states (ST). Thus by stating
that there is a connection of type X between two points we mean that their
two components are in a state to exchange force in as much as allowed by the
type X of the connection. Classifying connections as states we implicitly add
a temporal parameter to the connections. However, as anticipated, we do not
exploit temporal information in this formalization.
      </p>
      <p>To capture this, we introduce a ternary relation Connect(x; y; z) whose
intended reading is \connection x holds between connection points y and z (in
this order)."</p>
      <p>
        Connect(x; y; z) ! ST(x) ^ ConnPt(y) ^ ConnPt(z)
It goes without saying that connections relate di erent connection points:
(
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
(
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
(
        <xref ref-type="bibr" rid="ref12">12</xref>
        )
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
      </p>
      <p>Connect(x; y; z) ! y 6= z</p>
      <p>As said, behaviors in fr and sbf are similar but the state-transition
construction in sbf leads to a somewhat di erent formalization of behavior, in particular
to include causes or explanations for the transitions, an important aspect of sbf.
Starting from the notion of behaviour in fr, in the formalization of sbf we add
a notion of system behavior (SysBeh), namely a perdurant which is a non-empty
sequence of states describing at least a connection and at least one transition.
We classify transitions as achievements or accomplishments, i.e., in the
eventive category EV, see Figure 1. (An interesting alternative would be to model
transition types as simpli ed descriptions of events, this choice would amount
to introduce transitions as black box entities.) We use relations BehStart and
BehEnd to indicate the initial and nal states of a transition, respectively, i.e.,
\BehStart(x,y)" (\BehEnd(x,y)") means that x is the initial ( nal) state of y.</p>
      <p>SysBeh(x) ! Transition(x)</p>
      <p>Transition(x) ! EV(x)</p>
      <p>BehStart(x; y) _ BehEnd(x; y) ! ST(x) ^ Transition(y)
We are now ready to discuss functions in sbf. Functions are embedded in the
sbf language via a precise list of primitives inspired by the work of Bylander
[4]: create, destroy, expel, allow, pump and move. While functions are taken as
intended input-output relationships, resembling once again the fr approach,
there is an explicit commitment to interpret the behaviors from these elements.</p>
      <p>
        To capture the speci c role of these primitives, we add the following axioms
(where Func(x) stays for \x is an sbf function"):
[Create(x) _ Destroy(x) _ Expel(x) _ Allow(x) _ P ump(x) _ M ove(x)]
! Func(x) (
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
However, these functions are not taken as exhaustive in the sbf language, not
even in the sense that any other function should or could be seen as a
specialization or a combination of these. Indeed, SBF allows the user to add new
functions without restrictions. A basic separation in functional types is given by
the mandatory classi cation of function in achievement (Achieve), maintenance
(M aintain), prevention (P revent) and negation (N egate).
      </p>
      <p>Func(x) ! [Achieve(x)</p>
      <p>M aintain(x)</p>
      <p>P revent(x)</p>
      <p>N egate(x)] (16)
From the sbf's examples, these special cases and functions can be classi ed as
social objects in the terminology of dolce:</p>
      <p>Func(x) ! SOB(x)
However, di erently from fr the sbf system makes no direct reference to agents.
4.2</p>
      <sec id="sec-5-1">
        <title>Ontological description</title>
        <p>In this section we provide a more detailed ontological characterization of sbf in
terms of the four relationships that relate:
1. physical components with physical components: PhCompOf
2. physical components with connection points: HasConnPt
3. physical components with functions: HasFunc
4. functions with behaviors: FBCorr</p>
        <p>We add relation PhCompOf(x; y), stating that x is a component of (device or
component) y, to make explicit the components' structure. We also enforce the
existence of a maximal component, namely, the device itself (axiom (20) makes
explicit that the sbf models are contextualized to the chosen device). Then,
we enforce each component to refer to only one larger component so that the
component hierarchy is a tree as requested by sbf:</p>
        <p>PhCompOf(x; y) ! PP(x; y)
PhCompOf(x; y) ! PhComp(x) ^ PhComp(y)</p>
        <p>9x8y:PhCompOf(x; y)
PhCompOf(x; y1) ^ PhCompOf(x; y2) ! y1 = y2
(17)
(18)
(19)
(20)
(21)
There is no real di erence between components and devices in sbf, thus we
do not introduce a speci c predicate for devices. The distinction is a matter of
focus: components are seen as (functional) parts of larger devices. A component
is itself a device from the perspective of any of its subcomponents. Since sbf
always concentrates on a single device, any other element in the modeling is a
component and components can be nested.</p>
        <p>Since the notion of connection point (ConnPt) involves the relation of having
a connection point, and HasConnPt(x; y) means that x has y as a connection
point, we can de ne the former in terms of the latter:</p>
        <p>ConnPt(x) , 9y HasConnPt(y; x)
In turn, it seems that HasConnPt(x; y) is ontologically subsumed by the relation
of parthood:</p>
        <p>
          HasConnPt(x; y) ! PP(y; x)
Note that de nition 22 and axioms (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ), (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ), (
          <xref ref-type="bibr" rid="ref9">9</xref>
          ) imply, in dolce system, that
HasConnPt(x; y) ! :PhComp(y). Since components, and not substances, may
have connection points, we need:
        </p>
        <p>
          HasConnPt(x; y) ! PhComp(x)
Recall that connection points are features, axiom (
          <xref ref-type="bibr" rid="ref9">9</xref>
          ), and that substances are
material (M) or non-physical endurants (NPED), axiom (
          <xref ref-type="bibr" rid="ref8">8</xref>
          ), thus it follows from
dolce that connection points and substances are distinct.
        </p>
        <p>To relate physical components with their functions we introduce HasFunc(x; y)
to mean that component x has function y.
(23)
(24)
(25)
(26)
(27)
(28)
(29)
(30)
HasFunc(x; y) ! PhComp(x) ^ Func(y)</p>
        <p>Func(x) ! 9y HasFunc(y; x)</p>
        <p>PhComp(x) ! 9y HasFunc(x; y)</p>
        <p>As said above, in both sbf and fr functions are derived notions: they select a
\reading" of behaviors, and so (perhaps implicitly) provide the agent's viewpoint.
The reading is given by selecting the purpose of an entity in a given situation and
by considering the entity's behavior as the way that purpose is accomplished.
We already stated in (25) that each component in sbf has a function. We can
now state a correspondence (FBCorr) between functions and behaviors:
FBCorr(x; y) ! Func(x) ^ SysBeh(y)</p>
        <p>Func(x) ! 9y FBCorr(x; y)</p>
        <p>FBCorr(x; y1) ^ FBCorr(x; y2) ! y1 = y2</p>
        <p>Finally, we provide a further characterization of the sbf notion of behavior.
Axiom (31) states that a system behavior is the event sum of the states of
`behavior start' and `behavior end' plus the transition event between them (the
sum is ordered since they have a temporal dimension). Axiom (32) states that
these system behaviors are uniquely identi ed by their input and output states.</p>
        <p>SysBeh(x) !</p>
        <p>9y; v; z [BehStart(y; x) ^ BehEnd(v; x) ^ Transition(z) ^ x = y + z + v](31)
(BehStart(x; z1) ^ BehEnd(y; z1)) ^ (BehStart(x; z2) ^ BehEnd(y; z2)) !
z1 = z2(32)
Note that the transition (an event in dolce) is naturally directed from the initial
state to the ending state and provides the information on how the state change
happens, that is, it also includes the causal explanation(s) requested by sbf.
Further formal characteristics. Our ontological characterization of sbf has
modeled the explicit ontological aspects of sbf. Below we characterize some key
sbf notions in more detail, but this is rather an extension than an explication.</p>
        <p>Since PhCompOf is subsumed by the relation of parthood, following [6] we
assume that it is a (strict) partial order:
:PhCompOf(x; x)</p>
        <p>PhCompOf(x; y) ^ PhCompOf(y; z) ! PhCompOf(x; z)
Furthermore, while the system seems to be extensional, it is unclear whether
the mereological reconstruction of these notions requires more speci c principles
like, e.g., strong supplementation [13, p. 29].</p>
        <p>We know that PhComp and HasConnPt are related via axiom (24), but there
seem to be an implicit relationship among them stating that each physical
component has at least one connection point:</p>
        <p>PhComp(x) ! 9y HasConnPt(x; y)
Together, they amount to the following equivalence which is easily justi ed
within the engineering perspective:</p>
        <p>PhComp(x) $ 9y HasConnPt(x; y)
Another implicit assumption seem to bind connection points to unique bearers:
(33)
(34)
(35)
(36)
HasConnPt(x1; y) ^ HasConnPt(x2; y) ! x1 = x2
(37)
5</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>We have studied the concepts underlying Goel's sbf model and proposed a
formalization of the system within the dolce foundational ontology. The
formal characterization of the sbf concepts aimed to cover three key elements:
structure, behavior and function. The analysis and the subsequent formalisation
show that notions like component, substance and connection point, are only
partially characterized and that further information should be collected from other
sources, for instance by directly analyzing sbf software packages on component
and functional information. We have not investigated this type of material here.</p>
      <p>While there are strong connections between the sbf and fr models of
function, our analysis shows some important di erences which have not been
highlight in the literature. The notion of function in sbf does not admit a direct
dependence on agents as in fr and, while remaining compatible with the latter,
seems to carefully introduce a framework where agents have no explicit role.
Furthermore, sbf introduces a short list of functions, showing that function
classi cation is relevant for the framework, but does not include the general
distinction between device-centric and environment-centric functions which is at
the core of the fr model. Finally, sbf provides the tool for a mereological
description of the structure of devices by introducing components and connection
ports, while fr focuses mainly on the relations between the devices and their
environment.</p>
      <p>With this analysis and formalization we are now in the position to formally
compare the sbf concept of function with other engineering concepts of
function and to extend the means for interoperability across engineering functional
descriptions of technical artifacts based on di erent concepts of function. This
will be a subject of future research.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Borgo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carrara</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garbacz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vermaas</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          , (
          <year>2009</year>
          ),
          <article-title>\A Formal Ontological Perspective on the Behaviors and Functions of Technical Artifacts", Arti cial Intelligence for Engineering Design, Analysis</article-title>
          and Manufacturing,
          <volume>23</volume>
          (
          <issue>1</issue>
          ),
          <fpage>3</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Borgo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carrara</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garbacz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vermaas</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          , (
          <year>2011</year>
          ),
          <article-title>\A Formalization of Functions as Operations on Flows"</article-title>
          ,
          <source>Journal of Computing and Information Science in Engineering</source>
          ,
          <volume>11</volume>
          ,
          <fpage>031007</fpage>
          -
          <lpage>031020</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Borgo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and Leita~o,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , (
          <year>2007</year>
          ),
          <article-title>Foundations for a Core Ontology of Manufacturing, in Ontologies: A Handbook of Principles, Concepts and Applications in Information Systems</article-title>
          ,
          <source>Integrated Series in Information Systems</source>
          Vol.
          <volume>14</volume>
          , ed. by Kishore R.,
          <string-name>
            <surname>Ramesh</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharman</surname>
            <given-names>R.</given-names>
          </string-name>
          , Springer, New York, pp.
          <fpage>751</fpage>
          -
          <lpage>776</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bylander</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , (
          <year>1991</year>
          ),
          <article-title>\A Theory of Consolidation for Reasoning about Devices"</article-title>
          ,
          <source>Man-Machine Studies</source>
          ,
          <volume>35</volume>
          ,
          <fpage>467</fpage>
          -
          <lpage>489</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Carrara</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garbacz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vermaas</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          , (
          <year>2011</year>
          ), \
          <article-title>If Engineering Function is a Family Resemblance Concept: Assessing Three Formalization Strategies"</article-title>
          ,
          <source>Applied Ontology</source>
          ,
          <volume>6</volume>
          (
          <issue>2</issue>
          ),
          <fpage>141</fpage>
          -
          <lpage>163</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Casati</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varzi</surname>
            ,
            <given-names>A. C.</given-names>
          </string-name>
          , (
          <year>2003</year>
          ),
          <article-title>Parts and Places: The Structures of Spatial Representation</article-title>
          , MIT Press, Cambridge, MA.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Chandrasekaran</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , (
          <year>2005</year>
          ), \
          <article-title>Representing Function: Relating Functional Representation and Functional Modeling Research Streams", Arti cial Intelligence for Engineering Design, Analysis</article-title>
          and Manufacturing,
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <fpage>65</fpage>
          -
          <lpage>74</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Chandrasekaran</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Josephson</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          , (
          <year>2000</year>
          ), \
          <article-title>Function in Device Representation"</article-title>
          , Engineering with Computers,
          <volume>16</volume>
          (
          <issue>3</issue>
          /4),
          <fpage>162</fpage>
          -
          <lpage>177</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Garbacz</surname>
            , Borgo,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carrara</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vermaas</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          , (
          <year>2011</year>
          ), \
          <article-title>Two Ontology-Driven Formalisations of Functions and Their Comparison"</article-title>
          ,
          <source>Journal of Engineering Design</source>
          ,
          <volume>22</volume>
          ,
          <fpage>733</fpage>
          -
          <lpage>764</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Goel</surname>
            ,
            <given-names>A. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rugaber</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vattam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , (
          <year>2009</year>
          ), \Structure, Behavior, and
          <article-title>Function of Complex Systems: The Structure, Behavior,</article-title>
          and
          <article-title>Function Modeling Language"</article-title>
          , Art. Intelligence for Engineering Design,
          <source>Analysis and Manufacturing</source>
          ,
          <volume>23</volume>
          (
          <issue>1</issue>
          ),
          <fpage>23</fpage>
          -
          <lpage>35</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Goel</surname>
            ,
            <given-names>A. K.</given-names>
          </string-name>
          , (
          <year>2013</year>
          ), \
          <article-title>One Thirty Year Long Case Study; Fifteen Principles: Implications of an AI Methodology for Functional Modeling", Arti cial Intelligence for Engineering Design, Analysis</article-title>
          and Manufacturing,
          <volume>27</volume>
          (
          <issue>3</issue>
          ),
          <fpage>203</fpage>
          -
          <lpage>215</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Masolo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borgo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gangemi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guarino</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oltramari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , (
          <year>2002</year>
          ),
          <article-title>WonderWeb Deliverable D18</article-title>
          .
          <article-title>Ontology Library ( nal</article-title>
          ),
          <source>WonderWeb European Project</source>
          ,
          <year>2003</year>
          . http://wonderweb.man.ac.uk/deliverables/documents/D18.pdf
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Simons</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , (
          <year>1987</year>
          ),
          <article-title>Parts: A Study in Ontology</article-title>
          , Oxford University Press, Oxford.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Stone</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wood</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , (
          <year>2000</year>
          ), \
          <article-title>Development of a Functional Basis for Design"</article-title>
          ,
          <source>Journal of Mechanical Design</source>
          ,
          <volume>122</volume>
          (
          <issue>4</issue>
          ),
          <fpage>359</fpage>
          -
          <lpage>370</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Vermaas</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eckert</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , (
          <year>2013</year>
          ), \
          <article-title>My Functional Description is Better!", Articial Intelligence for Engineering Design, Analysis</article-title>
          and Manufacturing,
          <volume>27</volume>
          ,
          <fpage>187</fpage>
          -
          <lpage>190</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>