Well-structured transition systems everywhere!
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
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
A generic type system for the Pi-calculus
Theoretical Computer Science
Spatial and Behavioral Types in the Pi-Calculus
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Spatial and behavioral types in the pi-calculus
Information and Computation
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
In the pi-calculus, we consider decidability of certain safety properties expressed in a simple spatial logic. We first introduce a behavioural type system that, given a process P , tries to extract a spatial-behavioural type T , in the form of a ccs term that is logically equivalent to the given process. Using techniques based on well-structured transition systems, we then prove that, for an interesting fragment of the considered logic, satisfiability (T *** *** ) is decidable for types. As a consequence of logical equivalence between types and processes, we obtain decidability of this fragment of the logic for all well-typed pi-processes.