Sciweavers

1101 search results - page 187 / 221
» Forcing in proof theory
Sort
View
SIAMCO
2002
70views more  SIAMCO 2002»
13 years 8 months ago
Lossless and Dissipative Distributed Systems
This paper deals with linear shift-invariant distributed systems. By this we mean systems described by constant coefficient linear partial differential equations. We define dissipa...
Harish K. Pillai, Jan C. Willems
ICTAC
2010
Springer
13 years 7 months ago
A Modality for Safe Resource Sharing and Code Reentrancy
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
Rui Shi, Dengping Zhu, Hongwei Xi
IJCM
2010
80views more  IJCM 2010»
13 years 7 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
JGT
2010
57views more  JGT 2010»
13 years 7 months ago
NZ-flows in strong products of graphs
: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cu...
LICS
2010
IEEE
13 years 7 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...