Journal of Computer Science and Technology

, Volume 19, Issue 3, pp 364–373 | Cite as

Process algebra approach to reasoning about concurrent actions

Formal Methods

Abstract

A reasonable transition rule is proposed for synchronized actions and some equational properties of bisimilarity and weak bisimilarity in the process algebra for reasoning about concurrent actions are presented.

Keywords

process global store constraint set bisimulation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Reiter R. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Lifschitz V (Ed.). Academic Press, New York, 1991, pp.359–380.Google Scholar
  2. [2]
    Gelfong M, Lifschitz V. Representing action and change by logic programs.J. Logic Programming, 1993, 17: 301–322.CrossRefMathSciNetGoogle Scholar
  3. [3]
    Chen X J, De Giacomo G. Reasoning about nondeterministic and concurrent actions: A process algebra approach.Artificial Intelligence, 1999, 107: 63–98.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Milner R. Communication and Concurrency. Prentice Hall, New York, 1989.MATHGoogle Scholar
  5. [5]
    Ying M S. Topology in Process Calculus: Approximate Correctness and Infinite Evolution. Springer-Verlag, New York, 2001.MATHGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2004

Authors and Affiliations

  1. 1.State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and TechnologyPsinghua UniversityBeijingP.R. China

Personalised recommendations