Complete proof systems for observation congruences in finite-control φ-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 443-454

  Lin, H ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

FINITE CONTROL; OBSERVATION CONGRUENCES; PROOF SYSTEM; RECURSIONS; SYMBOLIC BISIMULATION; WEAK BISIMULATION;

CALCULATIONS;

EID: 84878573976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055074     Document Type: Conference Paper

References (11)

1. Michèle Boreale and Rocco De Nicola. A symbolic semantics for the 7r-calculus. Information and Computation, 126(1):34-52, 1996.
2. M. Dam. Model checking mobile processes. Information and Computation, 129:35-51, 1996.
3. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353-389, 1995.
4. H. Lin. Symbolic bisimulations and proof systems for the φ-calculus. Report 7/94, Computer Science, University of Sussex, 1994.
5. H. Lin. Complete inference systems for weak bisimulation equivalences in the φ-calculus. In TAPSOFT'95, LNCS 915. Springer-Verlag, 1995.
6. H. Lin. Unique fixpoint induction for the φ-calculus. In CONCUR'95, LNCS 9G2. Springer-Verlag, 1995.
7. R. Milner. A complete inference system for a class of regular behaviours. J. Computer and System Science, 28:439-466, 1984.
8. R. Milner. A complete axiomatisation for observational congruence of finite-state behaviours. Information and Computation, 81:227-247, 1989.
9. R. Milner, J. Parrow, and D. Walker. A calculus of mobile proceses, part I, II. Information and Computation, 100:1-77, 1992.
10. J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Information and Computation, 120(2):174-197, 1995.
11. Davide Sangiorgi. A theory of bisimulation for the φ-calculus. Acta Informatica, 33:69-97, 1996.