FCT 1995 | Sciweavers

48

FCT
1995
Springer

143views Applied Computing» more FCT 1995»

Axiomatizing Petri Net Concatenable Processes

14 years 3 months ago

The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...

Vladimiro Sassone

claim paper

Read More »

36

click to vote

FCT
1995
Springer

82views Applied Computing» more FCT 1995»

On the Synchronization of Semi-Traces

14 years 3 months ago

Download www2-fs.informatik.uni-tuebingen.de

The synchronization of two or more semi-traces describes the possible evaluation of a concurrent system, which consists of two or more concurrent subsystems in a modular way, where...

Klaus Reinhardt

claim paper

Read More »

31

click to vote

FCT
1995
Springer

123views Applied Computing» more FCT 1995»

Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs

14 years 3 months ago

Download www.ceid.upatras.gr

Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...

Hristo Djidjev, Grammati E. Pantziou, Christos D. ...

claim paper

Read More »

32

click to vote

FCT
1995
Springer

94views Applied Computing» more FCT 1995»

Discrete Time Process Algebra with Abstraction

14 years 3 months ago