Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: integer approximations

Sortuj według:

Ogranicz wyniki do:

Full Axiomatisation of Timed Processes of Interval-Timed Petri Nets

Pelz E.

Fundamenta Informaticae

2018

Vol. 157, nr 4

427--442

In this paper we use partial order semantics to express the truly concurrent behaviour of Interval-Timed Petri nets (ITPNs) in their most general setting, i.e. with autoconcurrency and zero duration, as studied with its standard maximal step semantics in [1]. First we introduce the notion of timed processes for ITPNs inductively. Then we investigate if the equivalence of inductive and axiomatic process semantics - true for classical Petri nets - could hold for ITPNs too. We will see that the notions of independence and immediate firing obligation seem to be antagonistic ones, and that local axioms, adequate to define processes of classical Petri nets, are not sufficient to caracterize timed processes of ITPNs. We propose several original “global” axioms which reveal to be an effective solution. Thus we yield finally a full axiomatic definition of timed processes for ITPNs.