Finitely Branching LTS’s from Reaction Semantics for Process Calculi (original) (raw)
Related papers
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
Lecture Notes in Computer Science, 2009
A π-calculus with explicit substitutions: The late semantics
Lecture Notes in Computer Science, 1994
Final semantics for the π-calculus
Programming Concepts and Methods PROCOMET ’98, 1998
On the expressivity of infinite and local behaviour in fragments of the pi-calculus
The weak late π-calculus semantics as observation equivalence
Lecture Notes in Computer Science, 1995
RPO, Second-Order Contexts, and λ Calculus
Higher category models of the pi-calculus
2015
RPO, Second-order Contexts, and Lambda-calculus
Logical Methods in Computer Science, 2009
Comodels and Effects in Mathematical Operational Semantics
Lecture Notes in Computer Science, 2013
A Fully Abstract Model for the π-calculus
Information and Computation, 2002
The-calculus: Notes on labelled semantics
1998
A Fully-Abstract Model for the pi-Calculus (Extended Abstract)
From a concurrent λ-calculus to the π-calculus
Presheaf models for the π-calculus
Category Theory and Computer Science, 1997
A π-calculus with explicit substitutions
Theoretical Computer Science, 1996
Foundations of Process Calculi and Contextual Systems
2005
Active Evaluation Contexts for Reaction Semantics
Electronic Notes in Theoretical Computer Science, 2007
On the decidability of process equivalences for the π-calculus
Theoretical Computer Science, 1997
Relating maximality-based semantics to action refinement in process algebras
Djamel-Eddine Saïdouni, Djamel Eddine Saïdouni, Jean-pierre Courtiat
Lecture Notes in Computer Science, 2010
Modeling Fresh Names in the π-calculus Using Abstractions
Electronic Notes in Theoretical Computer Science, 2004
Hybrid Semantics for Stochastic π-Calculus
Algebraic Biology, 2008
Universal Coinductive Characterisations of Process Semantics
IFIP International Federation for Information Processing, 2008
A Concrete Categorical Model for the Lambek Calculus
1995
On the existence and decidability of unique decompositions of processes in the applied π-calculus
Theoretical Computer Science, 2016
Mathematical Foundations of Programming Semantics, 1994
Mathematical Foundations of Programming Semantics, 1992
Finite equational bases in process algebra: Results and open questions
Processes, Terms and Cycles: Steps on the Road to Infinity, 2005
On encoding the pi-calculus in higher-order calculi
2008
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science, 2004
From a Concurrent Lambda-Calculus to the Pi-Calculus
1995
Communication, and concurrency with logic-based restriction inside a calculus of structures
2012
A Well-behaved LTS for the Pi-calculus::(Abstract)
Electronic Notes in Theoretical Computer Science, 2007
On the observational theory of the CPS-calculus
Acta Informatica, 2010
Representing operational semantics with enriched Lawvere theories
2017