A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Parallelism and Synchronization in an Infinitary Context (Long Version)
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
We study multitoken interaction machines in the context of a very expressive logical system with exponentials, fixpoints and synchronization. ...
The advantage of such machines is to provide models in the style of the Geometry of Interaction, i.e., an interactive semantics which is close to low-level implementation. ...
The second and third authors were supported by the project ANR-2010-BLANC-021301 "LOGOI". ...
arXiv:1505.03635v2
fatcat:4qdju2mlobarfeo77utwodkhbi
Parallelism and Synchronization in an Infinitary Context
2015
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We study multitoken interaction machines in the context of a very expressive linear logical system with exponentials, fixpoints and synchronization. ...
We introduce SMEYLL nets, whose expressiveness is increased over MELL nets by several constructs: we have fixpoints (captured by the Y -box), an operator for synchronization (the sync node), and a primitive ...
., when the redex occurs at depth 0), and not in an arbitrary context. ...
doi:10.1109/lics.2015.58
dblp:conf/lics/LagoFVY15
fatcat:3kboikwsxbeebehaex6jgq7scm
Page 7459 of Mathematical Reviews Vol. , Issue 94m
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “The theory of CSP is extended to include an infinitary parallel composition operator. ...
The oper- ator is continuous in each of its arguments, and in fact preserves the limits of almost all chains in the infinitary product c.p.o. ...
Page 2310 of Mathematical Reviews Vol. , Issue 2003d
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Finally, we interpret affine type-free Au-calculus by introducing another partial applicative structure which has an asynchronous application operator and allows a parallel limit operation.” ...
Berry introduced a special kind of Scott models, called stable, and showed that the parallel-or is not a stable function. ...
Fairness and regularity for SCCS processes
1989
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Darondeau and D. Muller, with whom we had fruitful discussions while elaborating this paper, and who influenced decisively its development, and A. Arnold, L. Priese, A. Saoudi, P. ...
Schupp, and the anymous référées for their insightful comments. ...
A subprocess is any concurrent component in a synchronous product; a process is enabled if it has the possibility of performing an effective action, and it is active if it performs an effective action, ...
doi:10.1051/ita/1989230100591
fatcat:2vmazhdtiba6tmfrnpipn23nr4
Page 3187 of Mathematical Reviews Vol. , Issue 88f
[page]
1988
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
synchronous communica- tions and their implementation in CSP (pp. 145-169); Zvi Galil, Gad M. ...
Landau and Mordechai M. Yung, Distributed algorithms in synchronous broadcasting networks (pp. 171-184); Kim G. ...
Realizable and unrealizable specifications of reactive systems
[chapter]
1989
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We are grateful to Leo Harrington for his help with Theorem 1, and to Yuri Gurevich and Mark Manasse for interesting discussions on determinacy. ...
An example is given in the next section.
Realizability In the context of finite-state automata, we take transition systems without infinitary restrictions to be directly implementable. ...
As a special case, we consider finite-state processes linked by synchronous communication, in the style of CCS [Mil80] and CSP [Hoa85] . ...
doi:10.1007/bfb0035748
fatcat:5xo4uplmujc4ljrwfm5nqe5lru
Concurrent weighted logic
2015
Journal of Logical and Algebraic Methods in Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. ...
We develop a Hilbert-style axiomatic system for CWL and we prove weakand strong-completeness results for this logic. ...
a, b an action a * b -the synchronization of a and b. ...
doi:10.1016/j.jlamp.2015.07.002
fatcat:v2sh4cnctrbzxnkmcnc7nz7ave
Some decision problems for parallel communicating grammar systems
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Parallel communicating grammar systems (PCS, for short) are a new model of the parallel processing [IS] and they are aimed to combine the notions of parallelism and communication into a suitable model ...
In this paper we investigate several decision problems for parallel communicating grammar systems: the enabling, circularity, centralizing, conflict-freeness, boundedness, membership, equivalence, inclusion ...
Gheorghe Paun both for his encouraging comments and for suggesting the proof of Theorem 5.1 based on the Post correspondence problem. ...
doi:10.1016/0304-3975(94)90243-7
fatcat:nh5limleabfcvpxhj3spmcn7xy
Page 2668 of Mathematical Reviews Vol. , Issue 86f
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Author introduction: “Attribute grammars, introduced by Knuth, provide an attractive method of formalizing the semantics of context-free languages, and introduce a general framework of the syntax-directed ...
Inform. and Control 61 (1984), no. 3, 202-246. Author summary: “The semantics of a simple language for de- scribing tightly coupled ‘synchronous’ systems is defined. ...
Page 4528 of Mathematical Reviews Vol. , Issue 91H
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
, Computing large polynomial powers very fast in parallel (pp. 538-544). ...
ISBN 3-540-53082-7 Contents: Arendse Bernth, Treatment of anaphoric problems in referentially opaque contexts (pp. 1-25); Toni Bollinger, Karl-Hans Blasius and Uli Hedtstiick, Knowledge processing in the ...
Page 2402 of Mathematical Reviews Vol. , Issue 90D
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The results on the E-matching problem in constructor-based infinitary matching theories seem to be the first ones. Interesting conjectures and open problems end this remarkable investigation. ...
This paper provides an example of a semicontextual grammar, with |x| < 2 and |y| < 2 for all productions xy — xzy, that defines a language that is not context-free. This proves a conjecture of G. ...
Page 4739 of Mathematical Reviews Vol. , Issue 94h
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Sénizergues, An effec- tive version of Stallings’ theorem in the case of context-free groups (478-495); A. Lepist6, On the power of periodic iteration of mor- phisms (496-506); F. Mignosi and P. ...
); Faron Moller and Chris Tofts, Behavioural abstraction in TCCS (559-570); Carolyn Brown and Doug Gurr, Timing Petri nets categorically (571-582); Paul Gastin and An- toine Petit, Asynchronous cellular ...
A complete modal proof system for a subset of SCCS
[chapter]
1985
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Here using a simple semantic strategy we tentatively propose one and offer an example modal proof system for a subset of Milner's SCCS. ...
One of the main reasons for this is that unlike other major programming concepts parallelism does not appear to have a logical correlate. ...
Acknowledgements I weuld like to thank Bob Constable, Matthew Hennessy, Robin Milner, Gordon Plotkin and in particular Gerardo Costa for discussions and helpful comments on the topic of this paper. ...
doi:10.1007/3-540-15198-2_16
fatcat:lmabgcfgpbabnh44bth4rbsx3i
Page 2257 of Mathematical Reviews Vol. , Issue 94d
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Pentus, Lambek grammars are context free (429-433).
{The papers of mathematical interest that appear to be in final form are being reviewed individually. } ...
Das and Aisheng Mao, Embeddings in recursive combinato- rial networks (184-204); Mikkel Thorup, On shortcutting digraphs (205-211); Alain Cournier and Michel Habib, An efficient algo- rithm to recognize ...
« Previous
Showing results 1 — 15 out of 293 results