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
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
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
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
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
| Hi-index | 0.00 |
The 驴-calculus is one of the most important mobile process calculi and has been well studied in 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 驴-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 modal logic for 驴-calculus, an extension of the modal µ-calculus with boolean expressions over names, and primitives for name input and output are introduced as an appropriate temporal logic for the 驴-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. This algorithm 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.