Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A note on model checking the model &ngr;-calculus
Selected papers of the 16th international colloquium on Automata, languages, and programming
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
A modal logic for message passing processes
Acta Informatica
Model checking mobile processes
Information and Computation
On the decidability of process equivalences for the &pgr;-calculus
Theoretical Computer Science - Special issue on algebraic methodology and software technology
Communication and Concurrency
Local Model Checking for Value-Passing Processes (Extended Abstract)
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Toward a Modal Theory of Types for the pi-Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Model Checking Value-Passing Processes
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Hi-index | 0.00 |
The @p-calculus is one of the most important mobile process calculi and has been well studied in the literatures. Temporal logic is thought as a good compromise between description convenience and abstraction and can support useful computational applications, such as model-checking. In this paper, we use symbolic transition graph inherited from @p-calculus to model concurrent systems. A wide class of processes, that is, the finite-control processes can be represented as finite symbolic transition graph. A new version @p-@m-Logic is introduced as an appropriate temporal logic for the @p-calculus. Since we make a distinction between proposition and predicate, the possible interactions between recursion and first-order quantification can be solved. A concise semantics interpretation for our modal logic is given. Based on the above work, we provide a model checking algorithm for the logic, which follows the well-known Winskel's tag set method to deal with fixpoint operator. As for the problem of name instantiating, our algorithm follows the 'on-the-fly' style, and systematically employs schematic names. The correctness of the algorithm is shown.