A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Causality vs. Interleavings in Concurrent Game Semantics
2016
International Conference on Concurrency Theory
Preserved Fulltext
interleaving game semantics of programs. ...
We investigate relationships between interleaving and causal notions of game semantics for concurrent programming languages, focusing on the existence of canonical compact causal representations of the ...
Causality: (∥ b∈min(B) A ⊥ ) ∥ B, enriched with ((2, b), (
x 1 ∶ 1 A 1 , . . . , x n ∶ A n ⊢ 32:10 Causality vs. interleavings in concurrent game semantics M ∶ B is interpreted as a PO-strategy M ∶ A ...
doi:10.4230/lipics.concur.2016.32
dblp:conf/concur/CastellanC16
fatcat:nshtj7wadfbmxh2tgdvnrrfdci
Model-checking games for fixpoint logics with partial order models
2011
Information and Computation
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.
, in concurrent systems with partial order semantics, several properties not expressible with the μ-calculus. ...
Since the interleaving semantics of such models is not considered, some problems that may arise when using interleaving representations are avoided and new decidability results for partial order models ...
This SFL formula expresses the property that there exists an execution of causally dependent actions such that eventually two actions a and b can be executed
Fig. 2 . 2 Interleaving vs. partial order ...
doi:10.1016/j.ic.2010.12.002
fatcat:6ohjhbv23jds7m6jeuulgl2qre
On fixpoint logics and equivalences for processes with restricted nondeterminism
2015
Journal of Logic and Computation
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.
In partial order semantics, at least four different kinds of behaviour can be recognised: concurrency, causality, conflict, and confusion. In interleaving semantics, only conflicts can be observed. ...
In concurrency, processes can be studied using a partial order or an interleaving semantics. ...
The first part of this paper is an extended and revised version of [11] ; the second and third parts are based on unpublished results initially studied in [12] . ...
doi:10.1093/logcom/exv032
fatcat:lnpbai3nvzcgxgbvauammc2yge
Concurrent and Located Synchronizations in π-Calculus
[chapter]
2007
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 2019; you can also visit the original URL.
The file type is application/pdf.
As our main result we show that bisimilarity is a congruence for the concurrent semantics. This important property fails for the standard semantics. ...
We present two novel semantics for π-calculus. ...
Similar statements can be made for the (mixed-order) concurrent semantics in [9] , which has a causal flavor. ...
doi:10.1007/978-3-540-69507-3_33
fatcat:7jqx6yjp2zeepb7ihs6pwbqeya
Sequentiality vs. concurrency in games and logic
2003
Mathematical Structures in Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1111.7159v1 fatcat:bxorrmibkbddzfniyjno5db2im
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic. ...
Hence the additives have primacy in this form of game semantics, in exactly the same sense that the dynamic operations have primacy in the interleaving view of process algebra. ...
) , turns out to correspond exactly to the semantic constraint of stability on the strategies in the concurrent games model. ...
doi:10.1017/s0960129503003980
fatcat:4rx4fqb3q5d7bnud3hfmyhntly
Bicategories of Concurrent Games
[chapter]
2012
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 2019; you can also visit the original URL.
The file type is application/pdf.
This leads to a bicategory of general concurrent games in which the maps are nondeterministic concurrent strategies. ...
This paper summarises recent results on bicategories of concurrent games and strategies. ...
Thanks to Silvain Rideau and my coworkers on the project ECSYM, Pierre Clairambault and Julian Gutierrez who in particular assisted in the Aarhus course on which this summary is based. ...
doi:10.1007/978-3-642-28729-9_2
fatcat:cgyvxvtmzrepvii5xvdcovyl64
Conflict vs Causality in Event Structures
2019
Electronic Proceedings in 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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature. ...
As expected, in both cases the spectrum turns out to be simplified, since some notions of equivalence coincide in the simplified settings; actually, we prove that removing causality simplifies the spectrum ...
Conflict and causality are fundamental concepts for concurrency; indeed, they can also be found in other well-established models for concurrent computation, like Petri nets [25, 26, 27] and process algebras ...
doi:10.4204/eptcs.300.6
fatcat:ywh2yqqmvjdsbgobhin3qqzefm
Asynchronous games 2: The true concurrency of innocence
2006
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.
The interleaving semantics of -terms, expressed as innocent strategies, may be analysed in this framework, in the perspective of true concurrency. ...
Seen from this angle, game semantics is reminiscent of trace semantics in concurrency theory, where a process is identified to the sequences of requests it generates in the course of time. ...
What is the true concurrency counterpart of this interleaving semantics? ...
doi:10.1016/j.tcs.2006.01.016
fatcat:q2cb5iuvlncy7iw7n25n4gesr4
Asynchronous Games 2: The True Concurrency of Innocence
[chapter]
2004
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 2009; you can also visit the original URL.
The file type is application/pdf.
The interleaving semantics of -terms, expressed as innocent strategies, may be analyzed in this framework, in the perspective of true concurrency. ...
Seen from this angle, game semantics is reminiscent of trace semantics in concurrency theory, where a process is identified to the sequences of requests it generates in the course of time. ...
What is the true concurrency counterpart of this interleaving semantics? ...
doi:10.1007/978-3-540-28644-8_29
fatcat:xbw53fbxffh7plf3iphw5iwtim
Distributed computing column 53
2014
ACM SIGACT News
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 2016; you can also visit the original URL.
The file type is application/pdf.
vs. transactions). ...
that concurrency control mechanisms must live in the concurrency control engine of the database. ...
doi:10.1145/2596583.2596600
fatcat:lruhrujqvnccxdqj3tkbrhxeku
Dagstuhl seminar review
2014
ACM SIGACT News
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 2016; you can also visit the original URL.
The file type is application/pdf.
vs. transactions). ...
that concurrency control mechanisms must live in the concurrency control engine of the database. ...
doi:10.1145/2596583.2596601
fatcat:cdnh5juczjggjnhyoozzpsgkjm
A Logic for True Concurrency
[article]
2014
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. ...
We also propose an extension of the logic with fixpoint operators, thus allowing to describe causal and concurrency properties of infinite computations. ...
In particular a remark from the reviewers stimulated a more appropriate presentation of well-formed formulae. ...
arXiv:1110.4094v2
fatcat:rilpfihsbbdvpkdnlq4iceoi7q
A Logic for True Concurrency
2014
Journal of the ACM
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.
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. ...
We also propose an extension of the logic with fixpoint operators, thus allowing to describe causal and concurrency properties of infinite computations. ...
The second formula states that the after the execution of all pairs of concurrent events, labelled a and b, respectively, the formula ϕ holds. Example 3.8 (Interleaving vs. True Concurrency). ...
doi:10.1145/2629638
fatcat:mdivxmnbpzhvdpkw7dbjkx576i
A Logic for True Concurrency
[chapter]
2010
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.
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. ...
We also propose an extension of the logic with fixpoint operators, thus allowing to describe causal and concurrency properties of infinite computations. ...
The second formula states that the after the execution of all pairs of concurrent events, labelled a and b, respectively, the formula ϕ holds. Example 3.8 (Interleaving vs. True Concurrency). ...
doi:10.1007/978-3-642-15375-4_11
fatcat:ddvja3zkyrapdmmydicegpfyye
Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them
[article]
2021
arXiv
pre-print
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We also prove that the model reduction scheme still works in the modified framework. ...
The semantics was built on the modeling tradition of distributed systems. ...
Secondly, the semantics of strategic logics is traditionally based on synchronous concurrent game models. ...
arXiv:2003.03867v4
fatcat:bpqlzcjygbewpmbgjo24asbugq
« Previous
Showing results 1 — 15 out of 461 results