Sciweavers

148 search results - page 23 / 30
» Linear Logic on Petri Nets
Sort
View
CSR
2008
Springer
13 years 9 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
APN
2000
Springer
14 years 2 days ago
Pre- and Post-agglomerations for LTL Model Checking
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
Denis Poitrenaud, Jean-François Pradat-Peyr...
DAC
2006
ACM
14 years 8 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
QEST
2007
IEEE
14 years 2 months ago
Performance Trees: Expressiveness and Quantitative Semantics
—Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics,...
Tamas Suto, Jeremy T. Bradley, William J. Knottenb...
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger