Sciweavers

129 search results - page 12 / 26
» Completeness Results for Linear Logic on Petri Nets
Sort
View
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 4 months ago
Performance analysis of concurrent systems with early evaluation
Early evaluation allows to execute operations when enough information at the inputs has been received to determine the value at the outputs. Systems that can tolerate variable-lat...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
ICTL
1994
13 years 11 months ago
Completeness through Flatness in Two-Dimensional Temporal Logic
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
Yde Venema
APN
1995
Springer
13 years 11 months ago
An Algebraic Semantics for Hierarchical P/T Nets
The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is s...
Twan Basten, Marc Voorhoeve
LFCS
2007
Springer
14 years 1 months ago
A Decidable Temporal Logic of Repeating Values
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...
Stéphane Demri, Deepak D'Souza, Régi...
FAC
2002
66views more  FAC 2002»
13 years 7 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner