1369 search results - page 141 / 274 » On the Semantics of Petri Nets |
113
Voted
TCS
2011
14 years 7 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
119
click to vote
LREC
2008
15 years 2 months ago
2008
Lexical ontologies and semantic lexicons are important resources in natural language processing. They are used in various tasks and applications, especially where semantic process...
110
Voted
MSCS
2007
15 years 7 days ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
111
click to vote
WOSP
2004
ACM
15 years 6 months ago
2004
ACM
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
PERCOM
2006
ACM
16 years 10 days ago
2006
ACM
This paper addresses the problem of implementing an context model. First, the abstract context model is represented by a network of situations. Two different implementations for t...