Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Comparing locality and causality based equivalences
Acta Informatica
Information and Computation
Testing equivalence for mobile processes
Information and Computation
Handbook of logic in computer science (vol. 4)
A symbolic semantics for the &pgr;-calculus
Information and Computation
Models for concurrency: towards a classification
Theoretical Computer Science
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Non-interleaving semantics for mobile processes
Theoretical Computer Science
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
Proceedings of the 8th International Conference on Concurrency Theory
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract)
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
First-Order Axioms for Asynchrony
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Comparing Transition Systems with Independence and Asynchronous Transition Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Implementations and Semantics of a Concurrent Programming Language
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Permutation of transitions: An event structure semantics for CCS and SCCS
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Presheaf models for CCS-like languages
Theoretical Computer Science
Secure composition of untrusted code: box π, wrappers, and causality types
Journal of Computer Security - CSFW13
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A Well-behaved LTS for the Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Free-algebra models for the π -calculus
Theoretical Computer Science
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A congruence rule format for name-passing process calculi
Information and Computation
Comparing Operational Models of Name-Passing Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual π-calculus operations, defining Indexed Labelled Transition Systems. For non-interleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving model and the standard Asynchronous Transition Systems model for CCS-like calculi. In each case we relate a denotational semantics to an operational view, for bisimulation and causal bisimulation respectively. We establish completeness properties of, and adjunctions between, categories of the two models. Alternative indexing structures and possible applications are also discussed. These are first steps towards a uniform understanding of the semantics and operations of name-passing calculi.