Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
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 theory of bisimulation for the &lgr;-calculus
Acta Informatica
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
Non-interleaving semantics for mobile processes
Theoretical Computer Science
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Communication and Concurrency
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
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
Secure Composition of Insecure Components
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Secure Composition of Untrusted Code: Wrappers and Causality Types
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Categories of asynchronous systems
Categories of asynchronous systems
History-dependent automata: an introduction
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Petri net semantics of the finite π-calculus terms
Fundamenta Informaticae
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed event structures and the linear π-calculus
Theoretical Computer Science
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Families of Symmetries as Efficient Models of Resource Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
A petri net translation of π-calculus terms
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Modelling fusion calculus using HD-Automata
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Event structure semantics of parallel extrusion in the pi-calculus
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Petri Net Semantics of the Finite π-calculus Terms
Fundamenta Informaticae
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| 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-labeled transition system to support the usual pi-calculus operations, defining Indexed Labeled Transition Systems. For non-interleaving causal semantics, we define Indexed Labeled 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. This is a first step towards a uniform understanding of the semantics and operations of name-passing calculi.