Glynn Winskel

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013

Constraining rule-based dynamics with types.

[BibT_eX]

[DOI]

Vincent Danos

Russell Harmer

Math. Struct. Comput. Sci., 2013

Distributed Probabilistic and Quantum Strategies.

[BibT_eX]

[DOI]

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

On Concurrent Games with Payoff.

[BibT_eX]

[DOI]

Pierre Clairambault

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Strategies as Profunctors.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2013

Borel Determinacy of Concurrent Games.

[BibT_eX]

[DOI]

Julian Gutierrez

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Imperfect Information in Logic and Concurrent Games.

[BibT_eX]

[DOI]

Pierre Clairambault

Julian Gutierrez

Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012

Deterministic concurrent strategies.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

The Winning Ways of Concurrent Games.

[BibT_eX]

[DOI]

Pierre Clairambault

Julian Gutierrez

Christopher D. Thompson-Walsh

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Bicategories of Concurrent Games - (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information.

[BibT_eX]

[DOI]

Christopher D. Thompson-Walsh

Proceedings of the Logic and Program Semantics, 2012

2011

Containment in Rule-Based Models.

[BibT_eX]

[DOI]

Jonathan Hayman

Proceedings of the 2nd International Workshop on Static Analysis and Systems Biology, 2011

Events, Causality and Symmetry.

[BibT_eX]

[DOI]

Comput. J., 2011

Concurrent Strategies.

[BibT_eX]

[DOI]

Silvain Rideau

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

On the Expressivity of Symmetry in Event Structures.

[BibT_eX]

[DOI]

Sam Staton

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Prime algebraicity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Nominal Domain Theory for Concurrency.

[BibT_eX]

[DOI]

David Turner

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008

Independence and Concurrent Separation Logic.

[BibT_eX]

[DOI]

Jonathan Hayman

Log. Methods Comput. Sci., 2008

The unfolding of general Petri nets.

[BibT_eX]

[DOI]

Jonathan Hayman

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2008

2007

Event Structures with Symmetry.

[BibT_eX]

[DOI]

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Preface.

[BibT_eX]

[DOI]

Luca Cardelli

Marcelo P. Fiore

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Symmetry and Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006

Probabilistic event structures and domains.

[BibT_eX]

[DOI]

Daniele Varacca

Hagen Völzer

Theor. Comput. Sci., 2006

Distributing probability over non-determinism.

[BibT_eX]

[DOI]

Daniele Varacca

Math. Struct. Comput. Sci., 2006

Event Structure Spans for Nondeterministic Dataflow.

[BibT_eX]

[DOI]

Lucy Saunders-Evans

Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

2005

Profunctors, open maps and bisimulation.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

Name Generation and Linearity.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Relations in Concurrency.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2004

Domain theory for concurrency.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

A relational model of non-deterministic dataflow.

[BibT_eX]

[DOI]

Thomas T. Hildebrandt

Prakash Panangaden

Math. Struct. Comput. Sci., 2004

Petri Nets With Persistence.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models, 2004

Limit Preservation from Naturality.

[BibT_eX]

[DOI]

Mario Cáccamo

Proceedings of the 10th Conference on Category Theory in Computer Science, 2004

New-HOPLA: A Higher-order Process Language with Name Generation.

[BibT_eX]

[DOI]

Francesco Zappa Nardelli

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Presheaf models for CCS-like languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Full Abstraction for HOPLA.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2003, 2003

2002

Guest Editorial.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Linearity in Process Languages.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Composing Strand Spaces.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Calculus for categories.

[BibT_eX]

Proceedings of the Fixed Points in Computer Science, 2002

HOPLA-A Higher-Order Process Language.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

A Higher-Order Calculus for Categories.

[BibT_eX]

[DOI]

Mario Cáccamo

Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

Petri nets in cryptographic protocols.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Events in security protocols.

[BibT_eX]

[DOI]

Proceedings of the CCS 2001, 2001

2000

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2000

Bistructures, bidomains, and linear logic.

[BibT_eX]

Pierre-Louis Curien

Gordon D. Plotkin

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

Weak Bisimulation and Open Maps.

[BibT_eX]

[DOI]

Marcelo P. Fiore

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Event Structures as Presheaves -Two Representation Theorems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

A Theory of Recursive Domains with Applications to Concurrency.

[BibT_eX]

[DOI]

Marcelo P. Fiore

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

A Categorical Axiomatics for Bisimulation.

[BibT_eX]

[DOI]

John Power

Proceedings of the CONCUR '98: Concurrency Theory, 1998

A Linear Metalanguage for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1998

1997

An Operational Understanding of Bisimulation from Open Maps.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Higher-Order Operational Techniques in Semantics, 1997

Completeness Results for Linear Logic on Petri Nets.

[BibT_eX]

[DOI]

Uffe Engberg

Ann. Pure Appl. Log., 1997

Presheaf Models for the pi-Calculus.

[BibT_eX]

[DOI]

Ian Stark

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996

Models for Concurrency: Towards a Classification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Petri Nets and Bisimulation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Bisimulation from Open Maps.

[BibT_eX]

[DOI]

André Joyal

Inf. Comput., 1996

Presheaves as transition systems.

[BibT_eX]

[DOI]

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Presheaf Models for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

A Presheaf Semantics of Value-Passing Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '96, 1996

1995

CCS with Priority Choice

[BibT_eX]

[DOI]

Juanito Camilleri

Inf. Comput., January, 1995

Trace Structures and other Models for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Book of Traces, 1995

1994

Stable Bistructure Models of PCF.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

A Compositional Proof System for the Modal mu-Calculus

[BibT_eX]

[DOI]

Henrik Reif Andersen

Colin Stirling

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Bistructures, Bidomains and Linear Logic.

[BibT_eX]

[DOI]

Gordon D. Plotkin

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Relationships Between Models of Concurrency.

[BibT_eX]

[DOI]

Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Linear Logic on Petri Nets.

[BibT_eX]

[DOI]

Uffe Engberg

Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Deterministic Behavioural Models for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Bisimulation and open maps

[BibT_eX]

[DOI]

André Joyal

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

A Classification of Models for Concurrency.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '93, 1993

The formal semantics of programming languages - an introduction.

[BibT_eX]

Foundation of computing series, MIT Press, ISBN: 978-0-262-23169-5, 1993

1992

Compositional Checking of Satsfaction.

[BibT_eX]

[DOI]

Henrik Reif Andersen

Formal Methods Syst. Des., 1992

1991

Using Information Systems to Solve Recursive Domain Equations

[BibT_eX]

[DOI]

Kim Guldstrand Larsen

Inf. Comput., April, 1991

A Note on Model Checking the Modal nu-Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Petri Nets and Transition Systems (Abstract for an invited talk).

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

Compositional Checking of Satisfaction.

[BibT_eX]

[DOI]

Henrik Reif Andersen

Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

1990

A Compositional Proof System on a Category of Labelled Transition Systems

[BibT_eX]

[DOI]

Inf. Comput., 1990

On the Compositional Checking of Validity (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the CONCUR '90, 1990

Petri Nets as Models of Linear Logic.

[BibT_eX]

[DOI]

Uffe Engberg

Proceedings of the CAAP '90, 1990

1989

Domain Theoretic Models of Polymorphism

[BibT_eX]

[DOI]

Thierry Coquand

Carl A. Gunter

Inf. Comput., May, 1989

1988

An introduction to event structures.

[BibT_eX]

[DOI]

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

Petri Nets, Algebras, Morphisms, and Compositionality

[BibT_eX]

[DOI]