A Modal Proof System for Mobile Processes

スポンサーリンク

概要

• 論文の詳細を見る

• To promote rapid development of computer systems, concurrent / parallel processing is one of the promising research items. For the mathematical description for concurrent processes, there have been several proposal as process calculi, formal systems for concurrent processes, such as CCS, CSP, ACP, LOTOS, π-calculus. In this paper, we will propose a modal proof system for the π-calculus, introduced by Milner, Parrow and Walker in 1989. π-calculus is an extension of CCS or CSP, to express mobile agents. Purpose in this paper is to offer a proof system for the π-calculus based on propositional modal logics. A partial soundness and completeness is discussed. An extension of the resulting system is also considered.

• 一般社団法人情報処理学会の論文
• 1998-09-17

著者

• Togashi Atsushi

  Department Of Computer Science Shizuoka University

• KANEZASHI FUMIAKI

  Graduate School of Science and Engineering, Shizuoka University

• Kanezashi F

  Shizuoka Univ.

• Kanezashi Fumiaki

  Graduate School Of Science And Engineering Shizuoka University

関連論文

• System Requirements and Formal Specifications of Hierarchical Reactive Systems (特集 マルチメディアコミュニケーションシステム)
• A Modal Proof System for Mobile Processes
• On Typing Systems for the Polyadic $\pi$-Calculus(Concurrency Theory and Applications '96)
• Stereospecific [2π+2π+2π] Cycloaddition Reaction of Norbornadiene

スポンサーリンク