A generalization of the procedure of Karp and Miller to well structured transition systems
14th International Colloquium on Automata, languages and programming
Reduction and covering of infinite reachability trees
Information and Computation
The name discipline of uniform receptiveness
Theoretical Computer Science
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
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
Communication and Concurrency
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking mobile ambients
Theoretical Computer Science
A generic type system for the Pi-calculus
Theoretical Computer Science
Deciding validity in a spatial logic for trees
Journal of Functional Programming
Computation: finite and infinite machines
Computation: finite and infinite machines
Type-based information flow analysis for the π-calculus
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Expressiveness and complexity of graph logic
Information and Computation
A theory of structural stationarity in the π-Calculus
Acta Informatica
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
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Spatial-behavioral types, distributed services, and resources
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Spatial and behavioral types in the pi-calculus
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
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
Hi-index | 0.00 |
In the pi-calculus, we consider the decidability of model checking properties expressed in Shallow Logic, a simple spatial logic. We first introduce a behavioural type system that, given a pi-process P that might in general be infinite-control, tries to extract a spatial-behavioural type T, in the form of a ccs term that is logically equivalent to P. Employing techniques based on well-structured transition systems (wsts), we prove that model checking (T@?@f) is decidable for types, for a fragment of the logic that can be used to encode interesting safety and reachability properties. The wsts technique we rely upon requires first endowing the considered transition system with a well-quasi order, then defining a finite basis for the denotation of each formula. This is achieved by viewing types as forests, with a well-quasi order that corresponds to a form of forest embedding. As a consequence of the logical equivalence between types and processes, we obtain the decidability of the considered fragment of the logic for well-typed pi-processes. We discuss (un)decidability and complexity of model checking also outside the considered decidable fragment of Shallow Logic.