Time Processes for Time Nets

A4 Conference proceedings


Internal Authors/Editors


Publication Details

List of Authors: Tuomas Aura, Johan Lilius
Publisher: Springer-Verlag
Publication year: 1997
Publisher: Springer
Book title: Application and Theory of Petri Nets 1997
Title of series: Lecture Notes in Computer Science
Number in series: 1248
Volume number: 1248
Start page: 136
End page: 155
ISBN: 978-3-540-63139-2
eISBN: 978-3-540-69187-7
ISSN: 0302-9743


Abstract

The
objective
of
this
work
is
to
give
Merlin's
time
Petri
nets
a
partial
order
semantics
based
on
the
nonsequential
process
semantics
for
untimed
net
systems.
A
time
process
of
a
time
Petri
net
is
defined
as
a
traditionally
constructed
causal
process
whose
events
are
labeled
with
occurrence
times.
In
a
valid
timing,
the
occurrence
times
satisfy
specific
criteria
that
arise
from
the
interaction
between
timing
constraints
and
the
causal
ordering
of
events.
The
definitions
lead
to
an
efficient
algorithm
for
checking
the
validness
of
timings.
The
relationship
between
the
firing
schedules
of
a
time
Petri
net
and
the
interleavings
of
time
processes
that
preserve
both
causal
and
temporal
order
is
shown
to
be
bijective.
Also,
a
sufficient
condition
is
given
for
inferring
invalidity
of
timings
from
initial
subprocesses.
Alternatively,
the
valid
timings
can
be
presented
as
sets
of
alternative
linear
constrains.
From
them,
the
existence
of
a
valid
timing
can
be
de-

Last updated on 2019-26-08 at 05:52