Axiomatizing GSOS with Termination (2004)

Cached

Download Links

by J.C.M. Baeten , E.P. de Vink
Venue:THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
Citations:22 - 1 self

Documents Related by Co-Citation

89 Turning SOS Rules into Equations – Luca Aceto, Bard Bloom, Frits Vaandrager - 1994
125 Structural Operational Semantics – Luca Aceto, Wan Fokkink, Chris Verhoef - 1999
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
658 Concurrency and automata on infinite sequences – D Park - 1981
196 Bisimulation can’t be traced – B Bloom, S Istrail, A R Meyer - 1995
364 Process algebra for synchronous communication – J. A. Bergstra, J. W. Klop - 1984
495 Algebraic laws for nondeterminism and concurrency – Matthew Hennessy, Robin Milner - 1985
32 Deriving complete inference systems for a class of GSOS languages generating regular behaviours – L Aceto - 1994
53 Axioms for concurrency – F Moller - 1989
9 Axiomatisations of Weak Equivalences for De Simone Languages – Irek Ulidowski - 1995
3219 Communication and Concurrency – R Milner - 1990
3407 Communicating Sequential Processes – C. A. R. Hoare - 2004
36 A general conservative extension theorem in process algebra – Pedro R. D’Argenio, Chris Verhoef - 1994
53 Algèbre de processus et synchronisations – D Austry, G Boudol - 1984
8 Series and parallel operations on pomsets – Z Ésik, S Okawa - 1999
20 On “Axiomatising finite concurrent processes – L Aceto - 1994
10 An omega-complete Equational Specification of Interleaving – Wan Fokkink, Bas Luttik - 2000
49 The Equational Theory of Pomsets – L. Gischer - 1988
10 Nonfinite Axiomatizability of the Equational Theory of Shuffle – Zoltán Ésik, Michael Bertol - 1998