Theoretical Computer Science
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Handbook of logic in computer science (vol. 4)
Models for concurrency: towards a classification
Theoretical Computer Science
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Stability and Sequentiality in Dataflow Networks
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Stability Theorem in Rewriting Theory
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Focusing in asynchronous games
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
The structure of first-order causality
Mathematical Structures in Computer Science
An approach to innocent strategies as graphs
Information and Computation
Bicategories of concurrent games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Winning, losing and drawing in concurrent games with perfect or imperfect information
Logic and Program Semantics
The Winning Ways of Concurrent Games
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On Concurrent Games with Payoff
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of ?-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy plays according to its view. Extending the definition to nonalternating strategies is problematic, because the traditional definition of views is based on the hypothesis that Opponent and Proponent alternate during the interaction. Here, we take advantage of the diagrammatic reformulation of alternating innocence in asynchronous games, in order to provide a tentative definition of innocence in non-alternating games. The task is interesting, and far from easy. It requires the combination of true concurrency and game semantics in a clean and organic way, clarifying the relationship between asynchronous games and concurrent games in the sense of Abramsky and Melliès. It also requires an interactive reformulation of the usual acyclicity criterion of linear logic, as well as a directed variant, as a scheduling criterion.