Modeling concurrency with partial orders
International Journal of Parallel Programming
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Non-interleaving semantics for mobile processes
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strand spaces: proving security protocols correct
Journal of Computer Security
An open graph visualization system and its applications to software engineering
Software—Practice & Experience - Special issue on discrete algorithm engineering
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Trace and testing equivalence on asynchronous processes
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
The box algebra = Petri nets + process expressions
Information and Computation
Pi-Nets: A Graphical Form of pi-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Typing correspondence assertions for communication protocols
Theoretical Computer Science
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
Information and Computation
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
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
Event structure semantics for nominal calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A graphical representation for biological processes in the stochastic pi-calculus
Transactions on Computational Systems Biology VII
| Hi-index | 0.00 |
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pi-chart is a finite directed acyclic graph recording a computation in the pi-calculus. Each node represents a process, and each edge either represents a computation step, or a message-passing interaction. Pi-charts enjoy a natural pictorial representation, akin to message sequence charts, in which vertical edges represent control flow and horizontal edges represent data flow based on message passing. A pi-chart represents a single computation starting from its top (the nodes with no ancestors) to its bottom (the nodes with no descendants). Unlike conventional reductions or transitions, the edges in a pi-chart induce ancestry and other causal relations on processes. We give both compositional and operational definitions of pi-charts, and illustrate the additional expressivity afforded by the chart semantics via a series of examples.