Axiomatizing GSOS with termination

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

Volumn 2285, Issue , 2002, Pages 583-595

  Baeten, J C M ^a   De Vink, E P ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC GENERATION; AXIOMATIZATION; AXIOMATIZING; EQUATIONAL THEORY; SOUND AND COMPLETE; STRUCTURAL OPERATIONAL SEMANTICS; TRANSITION SYSTEM;

SEMANTICS;

EID: 84937408383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_48     Document Type: Conference Paper

References (13)

1. L. Aceto, B. Bloom, and F.W. Vaandrager.Turning SOS rules into equations. Information and Computation, 111:1–52, 1994.
2. J.C.M. Baeten. Embedding untimed into timed process algebra: the case for explicit termination.In L.Aceto and B.Victor, editors, Proc. EXPRESS’00, pages 45–62.ENTCS 39, 2000.
3. J.C.M. Baeten and J.A. Bergstra. Mode transfer in process algebra. Technical Report CSR 00-01, Division of Computer Science, TU/e, 2000.
4. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism. Fundamenta Informaticae, 4:127–168, 1986.
5. B. Bloom, S. Istrail, and A.R. Meyer.Bisimulation can’t be traced.Journal of the ACM, 42:232–268, 1995.Preliminary version in Proc.POPL’88.
6. E. Brinksma, editor. Information Processing Systems, Open Systems Interconnection, LOTOS – A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour.ISO Standard IS–8807, 1989.
7. J.C.M. Baeten and E.P. de Vink. Axiomatizing GSOS with termination. Technical Report CSR 01–06, Division of Computer Science, TU/e, 2001. See http://www.win.tue.nl/st/medew/pubbaeten.html.
8. J.C.M. Baeten and W.P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science.Cambridge University Press, 1990.
9. W.J. Fokkink. Introduction to Process Algebra.Texts in Theoretical Computer Science, An EATCS Series.Springer, 2000.
10. I. Ulidowski. Axiomatisations of weak equivalences for De Simone languages. In I. Lee and S. Smolka, editors, Proc. CONCUR’95, pages 219–233. LNCS 962, 1995.
11. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239:97–139, 2000.
12. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2:274–302, 1995.
13. J.L.M. Vrancken. The algebra of communicating processes with empty process. Theoretical Computer Science, 177:287–328, 1997.