|
1182
|
A Structural Approach to Operational Semantics
– G. D. Plotkin
- 1981
|
|
169
|
Bisimulation Can’t Be Traced
– B Bloom, S Istrael, A Meyer
- 1995
|
|
183
|
Structured operational semantics and bisimulation as a congruence
– J F Groote, F W Vaandrager
- 1992
|
|
107
|
Transition System Specification with Negative Premises
– J F Groote
- 1990
|
|
103
|
A Congruence Theorem for Structured Operational Semantics With Predicates
– J.C.M. Baeten, C. Verhoef
- 1993
|
|
69
|
The Meaning of Negative Premises in Transition System Specifications
– R N Bol, J F Groote
- 1996
|
|
35
|
The meaning of negative premises in transition system specifications II
– R.J. van Glabbeek
- 2004
|
|
58
|
Higher-level synchronising devices in Meije–SCCS. Theoretical Computer Science 37(3), pp. 245–267. A Modal Characterisation of η-Bisimulation We prove the first part of Thm. 2.5, which states that η is a modal characterisation of η-bisimulation equivalenc
– Robert De Simone, Communicated M. Nivat
- 1985
|
|
3119
|
Communicating Sequential Processes
– C. A. R. Hoare
- 2004
|
|
2972
|
Communication and Concurrency
– R Milner
- 1989
|
|
1263
|
The Stable Model Semantics For Logic Programming
– Michael Gelfond, Vladimir Lifschitz
- 1988
|
|
29
|
A Conservative Look at Operational Semantics with Variable Binding
– Wan Fokkink, Chris Verhoef
- 1998
|
|
743
|
The Well-Founded Semantics for General Logic Programs
– Kenneth A. Ross
- 1991
|
|
599
|
Concurrency and automata on infinite sequences
– D Park
- 1981
|
|
34
|
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
– Karen L. Bernstein
- 1997
|
|
124
|
Well-Founded Semantics Coincides with Three-Valued Stable Semantics
– Teodor Przymusinski
- 1990
|
|
122
|
Towards a Mathematical Operational Semantics
– Daniele Turi, Gordon Plotkin
- 1997
|
|
102
|
Structural Operational Semantics
– Luca Aceto, Wan Fokkink, Chris Verhoef
- 1999
|
|
448
|
Algebraic Laws for Nondeterminism and Concurrency
– M Hennessy, R Milner
- 1985
|
