Modal logics for communicating systems
Theoretical Computer Science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Decidability results in automata and process theory
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
The name discipline of uniform receptiveness
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Current trends in theoretical computer science
Types as models: model checking message-passing programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for lock-free processes
Information and Computation - IFIP TCS2000
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Implicit Typing à la ML for the Join-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Explicit Behavioral Typing for Object Interfaces
Proceedings of the Workshop on Object-Oriented Technology
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Infinite types for distributed object interfaces
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Behavioural Types for a Calculus of Concurrent Objects
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Mobile Petri Nets
A generic type system for the Pi-calculus
Theoretical Computer Science
Type-based information flow analysis for the π-calculus
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Resource usage analysis for the π-calculus
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Spatial and Behavioral Types in the Pi-Calculus
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Planning and verifying service composition
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Spatial and behavioral types in the pi-calculus
Information and Computation
Advanced mechanisms for service composition, query and discovery
Rigorous software engineering for service-oriented systems
| Hi-index | 0.00 |
We study methods to statically approximate "first-order" process calculi (Pi, Join) by "propositional" models (CCS, BPP, Petri nets). We consider both open and closed behavior of processes. In the case of open behavior, we propose a type system to associate pi-calculus processes with restriction-free CCS types. A process is shown to be in simulation relation with each of its types, hence safety properties that hold of the types also hold of the process. We refine this approach in the case of closed behavior: in this case, types are BPP processes. Sufficient conditions are given under which a minimal BPP type can be computed that is bisimilar to a given process. These results are extended to the Join calculus using place/transition Petri nets as types.