Sciweavers

498 search results - page 21 / 100

» On the Category of Petri Net Computations

32

MFCS
1993
Springer

115views Theoretical Computer Science» more MFCS 1993»

Completeness Results for Linear Logic on Petri Nets

14 years 16 days ago

Completeness Results for Linear Logic on Petri Nets

Download www.daimi.au.dk

Uffe Engberg, Glynn Winskel

claim paper

Read More »

23

REX
1993

123views Logical Reasoning» more REX 1993»

Linear Logic on Petri Nets

14 years 16 days ago

Linear Logic on Petri Nets

Download www.brics.dk

Uffe Engberg, Glynn Winskel

claim paper

Read More »

27

REX
1993

143views Logical Reasoning» more REX 1993»

An Introduction to the Theoretical Aspects of Coloured Petri Nets

14 years 16 days ago

An Introduction to the Theoretical Aspects of Coloured Petri Nets

Download www.dsc.ufcg.edu.br

Kurt Jensen

claim paper

Read More »

30

IWPEC
2010
Springer

209views Applied Computing» more IWPEC 2010»

Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier

13 years 6 months ago

Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier

Download www.cmi.ac.in

M. Praveen

claim paper

Read More »

29

FSTTCS
2009
Springer

97views Software Engineering» more FSTTCS 2009»

Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE

14 years 3 months ago

Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE

Download drops.dagstuhl.de

ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a ﬁxed set of buffers (modelled as unbounded places). We identify a param...

M. Praveen, Kamal Lodaya

claim paper

Read More »

« Prev « First page 21 / 100 Last » Next »