Luca Aceto, Wan Fokkink, Chris Verhoef  Home/Search
Context Related
| adam.wins.uva.nl/~x/sos/sos.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: adam.wins.uva.nl/~x/sos (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction 3 2 Preliminaries 6 2.1 Labelled Transition Systems . . . . . . . . . . . . . . . . . . . 7 2.2 Behavioural Equivalences . . . . . . . . . . . . . . . . . . . . 8 2.3 Hennessy-Milner Logic . . . . . . . . . . . . . . . . . . . . . . 11 2.4 Term Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.5 Transition System Specifications . . . . . . . . . . . . . . . . 13 2.6 Examples of TSSs . . . . . . . . . . . . . . . . . . . . . . . . 14 2.6.1 Basic Process... (Update)
Context of citations to this paper: More
.... markings in a process algebraic notation make it hard to de ne corresponding transitions via SOS (for Structural Operational Semantics, see [1]) rules without losing the recognizability theorem we aim at. In particular, we see no way of using the PA process algebra for this...
Cited by: More
Congruence for SOS with Data - Mohammadreza Mousavi Michel (Correct)
Some of My Favourite Results in Classic Process Algebra - Aceto (2003) (Correct)
Symbolic Equivalences for Open Systems - Baldan, al. (2003) (Correct)
Similar documents (at the sentence level):
52.1%: Structural Operational Semantics - Aceto, Fokkink, Verhoef (1999) (Correct)
7.7%: Conservative Extension in Structural Operational Semantics - Aceto, Fokkink, Verhoef (Correct)
Active bibliography (related documents): More All
7.0: CPO Models for GSOS Languages - Part I: Compact GSOS Languages - Aceto, Ingólfsdóttir (1994) (Correct)
1.7: On The Finitary Bisimulation - Aceto, Ingólfsdóttir (1995) (Correct)
0.9: Basic Multi-Competence Programming - Bergstra, Bethke, Ponse (2000) (Correct)
Similar documents based on text: More All
0.8: On the Expressiveness of ACP (Extended Abstract) - van Glabbeek (1994) (Correct)
0.7: A Congruence Theorem for Structured Operational Semantics With.. - Verhoef (1993) (Correct)
0.7: An SOS Message: Conservative Extension in Higher-Order.. - Fokkink, Verhoef (1997) (Correct)
Related documents from co-citation: More All
15: A Congruence Theorem for Structured Operational Semantics with Predicates - Baeten, Verhoef - 1993
11: A structural approach to operational semantics - Plotkin - 1981
10: Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1988
BibTeX entry: (Update)
L. Aceto, W. Fokkink, and C. Verhoef, Structural operational semantics, in Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, eds., Elsevier, 1999. To appear. http://citeseer.ist.psu.edu/aceto99structural.html More
@misc{ aceto99structural,
author = "L. Aceto and W. Fokkink and C. Verhoef",
title = "Structural operational semantics",
text = "L. Aceto, W. Fokkink, and C. Verhoef, Structural operational semantics,
in Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, eds.,
Elsevier, 1999. To appear.",
year = "1999",
url = "citeseer.ist.psu.edu/aceto99structural.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
854 Information and Computation (context) - Milner, Parrow et al. - 1992
759 Negation as failure (context) - Clark - 1978
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable, Allen et al. - 1986
502 Concurrency and automata on infinite sequences (context) - Park - 1981
447 Prentice-Hall International (context) - Concurrency - 1989
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
306 A syntactic approach to type soundness - Wright, Felleisen - 1994
266 Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Applications et al. - 1990
266 Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland et al. - 1990
247 Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
231 A theory of communicating sequential processes (context) - Brookes, Hoare et al. - 1984
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
208 An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
204 of Lecture Notes in Computer Science (context) - of, Systems - 1980
204 the declarative semantics of deductive databases and logic p.. (context) - Przymusinski - 1988
195 Department of Computer Science - of, in et al. - 1995
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
186 A temporal calculus of communicating systems (context) - Moller, Tofts
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1989
159 CML: A higher-order concurrent language (context) - Reppy - 1991
159 Non-well-founded Sets (context) - Aczel - 1988
149 Testing equivalences for processes (context) - De Nicola, Hennessy - 1984
146 Investigations into logical deduction (context) - Gentzen - 1969
146 EATCS Monographs on Theoretical Computer Science (context) - Reisig, nets et al. - 1985
146 A powerdomain construction (context) - Plotkin - 1976
138 Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987
123 A congruence theorem for structured operational semantics wi.. - Baeten, Verhoef
118 Unfounded sets and wellfounded semantics for general logic p.. (context) - Gelder, Ross et al. - 1988
112 Initial algebra semantics and continuous algebras (context) - Goguen, Thatcher et al. - 1977
104 Branching time and abstraction in bisimulation semantics (context) - Glabbeek, Weijland - 1989
102 Formal verification of parallel programs (context) - Keller - 1976
84 A domain equation for bisimulation (context) - Abramsky - 1991
84 Transition system specifications with negative premises (context) - Groote
78 Modal logics for communicating systems (context) - Stirling - 1987
76 Towards a mathematical semantics for computer languages (context) - Scott, Strachey - 1971
75 Proving congruence of bisimulation in functional programming.. - Howe - 1996
70 A process algebra for timed systems (context) - Hennessy, Regan - 1995
67 The syntax and semantics of CRL - Groote, Ponse
67 Towards a mathematical operational semantics - Turi, Plotkin - 1997
64 Department of Computer Science (context) - synchrony, Tech et al. - 1981
63 Semantics with Applications: A Formal Introduction (context) - Nielson, Nielson - 1992
53 The semantics of reflected proof - Allen, Constable et al. - 1990
52 The lazy lambda calculus in a concurrency scenario - Sangiorgi - 1994
49 Process algebra with iteration and nesting (context) - Bergstra, Bethke et al. - 1994
48 Towards a mathematical science of computation (context) - McCarthy - 1962
48 of Studies in Logic and the Foundation of Mathematics (context) - Barendregt, Calculus et al. - 1984
48 Generating BDDs for symbolic model checking in CCS (context) - Enders, Filkorn et al. - 1993
47 Fully abstract models of programming languages (context) - Stoughton - 1988
47 The meaning of negative premises in transition system specif.. (context) - Bol, Groote - 1996
47 The meaning of negative premises in transition system specif.. (context) - Bol, Groote - 1991
46 Initial algebra and final coalgebra semantics for concurrenc.. - Rutten, Turi
45 Syntax and defining equations for an interrupt mechanism (context) - Baeten, Bergstra et al. - 1986
44 An operational semantics for timed CSP - Schneider - 1995
42 Bisimulation can't be traced: preliminary report (context) - Bloom, Istrail et al. - 1988
40 Automated temporal reasoning about reactive systems - Emerson
38 Information and Control (context) - Bakker, Zucker et al. - 1982
37 A hardware implementation of Pure Esterel - Berry - 1991
37 relationship between proces algebra and inputoutput automata - relationship, algebra et al. - 1991
36 Concurrent processes and their syntax (context) - Milne, Milner - 1979
36 Basic process algebra with iteration: Completeness of its eq.. - Fokkink, Zantema - 1994
34 Semantical paradigms: notes for an invited lecture (context) - Meyer - 1988
30 The syntax and semantics of the proposed international algeb.. (context) - Backus - 1960
28 The concurrency workbench: A semantics-based verification to.. (context) - Cleaveland, Parrow et al. - 1993
28 From operational semantics to domain theory - Mason, Smith et al. - 1996
28 ebre de processus et synchronisations (context) - Austry, Boudol - 1984
27 On observing nondeterminism and concurrency (context) - Hennessy, Milner - 1980
27 Fixed point semantics (context) - Bergstra, Klop - 1982
25 A congruence theorem for structured operational semantics of.. - Bernstein - 1998
25 Information and Computation (context) - Nicollin, Sifakis et al. - 1994
25 Branching bisimilarity is an equivalence indeed - Basten - 1996
24 Mathematical Structures in Computer Science (context) - Abramsky, Vickers et al. - 1993
24 Processes: A mathematical model of computing agents (context) - Milner - 1973
24 deadlock and divergence (context) - Aceto, Hennessy - 1992
23 A conservative look at operational semantics with variable b.. - Fokkink, Verhoef - 1998
23 Completeness in real time process algebra (context) - Klusener - 1991
21 A term model for synchronous processes (context) - Hennessy - 1981
20 Compositionality via cut-elimination: Hennessy-Milner logic .. - Simpson - 1995
20 Timed process algebras with urgent interactions and a unique.. (context) - Bolognesi, Lucidi - 1991
20 The importance of the left merge operator (context) - Moller - 1990
18 The algebra of communicating processes with empty process (context) - Vrancken - 1997
18 Equivalences on observable processes - Ulidowski
18 Future Generation Computer Systems - Parrow, power et al. - 1990
18 Finiteness conditions and structural construction of automat.. - Madelaine, Vergamini - 1991
17 A complete proof system for SCCS with modal assertions (context) - Winskel - 1986
17 Process algebra semantics of POOL (context) - Vaandrager
17 A new fixpoint semantics for general logic programs compared.. (context) - Fages - 1991
17 Turing Award Lecture (context) - interaction - 1993
17 Ald'ebaran: a tool for verification of communicating process.. - Fernandez - 1989
16 Bounded nondeterminism and the approximation induction princ.. (context) - Glabbeek - 1987
16 Automated analysis of mutual exclusion algorithms using CCS (context) - Walker - 1989
15 From operational to denotational semantics (context) - Smith
14 Prentice-Hall International (context) - Roscoe, Theory et al. - 1998
14 An introduction to PSF d (context) - Mauw, Veltink - 1989
14 Axiomatizing prefix iteration with silent steps - Aceto, Fokkink et al. - 1996
13 Ntyftntyxt rule reduce to ntree rule - Glabbeek, rules et al. - 1996
12 Fundamenta Informaticae (context) - semantics, the et al. - 1990
11 Discrete-Time Process Algebra (context) - Vereijken - 1997
11 Process algebra with backtracking - Bergstra, Ponse et al.
11 Formal Language Description Languages for Computer Programmi.. (context) - Steel - 1966
11 An effective axiomatization for real time ACP - Fokkink, Klusener - 1995
11 From algebra to operational semantics (context) - Jifeng, Hoare - 1993
11 Deriving denotational models for bisimulation from structure.. (context) - Rutten - 1992
11 Theoretical Comput (context) - consistency, fair et al. - 1987
10 Department of Electrical Engineering and Computer Science (context) - Bloom, Simulation et al. - 1989
10 Information and Computation (context) - axiomatisation, congruence et al. - 1989
10 Deriving complete inference systems for a class of GSOS lang.. (context) - Aceto
10 Computer Science Department (context) - approach, semantics et al. - 1981
9 Full abstraction for a simple programming language (context) - Hennessy, Plotkin - 1979
9 From SOS rules to proof principles: An operational metatheor.. - Sands - 1997
9 go: structural operational semantics for linear-time process.. (context) - set - 1993
8 System Sci (context) - inference, for et al. - 1984
8 Structural operational specifications and trace automata (context) - Badouel, Darondeau
7 LATOS -- a Lightweight Animation Tool for Operational Semant.. - Hartel - 1997
7 Centre Sophia-Antipolis (context) - Simone, Vergamini et al. - 1989
7 A survey of axiom systems for process algebras (context) - Baeten, Bergstra - 1991
7 Theoretical Comput (context) - of, logic et al. - 1988
7 Formats of ordered SOS rules with silent actions - Ulidowski, Phillips - 1997
7 Generating BDD models for process algebra terms (context) - Dsouza, Bloom - 1995
7 Concurrency and computability (context) - Darondeau - 1990
6 CPO models for a class of GSOS languages - Aceto, Ing'olfsd'ottir
6 University of Edinburgh (context) - in, theory - 1981
6 Logics for Concurrency: Structure versus Automata (context) - Moller, Birtwistle - 1996
6 of International Series of Monographs in Pure and Applied Ma.. (context) - Salomaa, Automata - 1969
6 Algebraic families of interpretations (context) - Courcelle, Nivat - 1976
6 Full abstraction in structural operational semantics (context) - in, semantics et al. - 1993
5 Institute for Electronic Systems (context) - Larsen, specifications et al. - 1989
5 A general conservative extension theorem (context) - D'Argenio - 1995
5 Formal definition of programming languages and systems (context) - Lucas - 1971
5 Theoretical Comput (context) - synchrony - 1983
5 A general conservative extension theorem (context) - D'Argenio, Verhoef - 1997
5 Information and Computation (context) - of, with - 1993
5 Communicating processes with value-passing and assignment (context) - Hennessy, Ing'olfsd'ottir - 1993
4 of Lecture Notes in Computer Science (context) - Guessarian, Semantics - 1981
4 Information and Computation (context) - for, languages - 1996
4 tyfttyxt format reduce to tree rule - tyft, reduces et al.
4 Reverse engineering and system renovation -- annotated bibli.. - van den Brand, Klint et al. - 1997
4 Semantic Models for Communicating Process with Value-Passing (context) - Ing'olfsd'ottir - 1994
4 Information and Computation (context) - abstract, for et al. - 1994
4 Cambridge Tracts in Theoretical Computer Science (context) - Stoltenberg-Hansen, om et al. - 1994
3 Proving finiteness of CCS processes by non-standard semantic.. (context) - De Francesco, Inverardi - 1994
3 Term rewriting properties of SOS axiomatisations (context) - Bosscher
3 Research Notes in Mathematics (context) - Rosenthal, their - 1990
3 School of Cognitive and Computing Sciences (context) - Jeffrey, completely et al. - 1992
3 Theoretical Comput (context) - models, typed - 1977
3 Formal definition of Algol (context) - Lauer - 1968
3 System Sci (context) - rules, termination et al. - 1986
3 Information and Control (context) - for, communication - 1984
2 Information and Computation (context) - rules, equations - 1994
2 Mathematical Structures in Computer Science (context) - terms, for - 1992
2 Theoretical Comput (context) - as, language - 1977
2 Conditional rewrite rules as an algebraic semantics of proce.. (context) - Badouel - 1990
2 Checking equations in GSOS systems (context) - Aceto, Bloom et al. - 1992
2 Calculabilit'e et Expressivit'e dans l'Alg`ebre de Processus.. (context) - Simone - 1984
2 Formal Aspects of Computing (context) - Ponse, processes et al. - 1996
2 Programming Concepts and Paradigms (context) - Watt - 1990
2 Nordic Journal of Computing (context) - theorem, operational et al. - 1995
2 Theoretical Comput (context) - revisited - 1988
2 Advances in Information Systems Science (context) - Bakker, programming - 1969
2 Theoretical Comput (context) - devices, Meije--SCCS - 1985
2 Theoretical Comput (context) - finite, systems - 1994
2 System Sci (context) - Smyth, Comput - 1978
2 Using a protean language to enhance expressiveness in specif.. (context) - Bloom, Cheng et al. - 1997
2 and logical characterizations of a notion of simulation of c.. (context) - of, denotational - 1991
1 To appear in Theoretical Computer Science (context) - as, precongruence et al. - 1998
1 Transition system specifications in stalk format with bisimu.. - Oostrom, de Vink - 1994
1 non-guarded definitions (context) - Meije, infinite et al. - 1984
1 A general conservative extension theorem (context) - extension, process et al. - 1994
1 Linear Unary Operators (context) - Operators, Algebra et al. - 1992
1 An operator definition principle (context) - Verhoef - 1991
1 To appear in Journal of Computer and System Sciences (context) - bisimulation, congruence et al. - 1998
1 Free University (context) - Semantics, Actions et al. - 1990
1 Information and Computation (context) - divergence - 1990
1 Theoretical Comput (context) - semantics, bisimulations - 1995
1 Flat lattice models of typed -calculus (context) - be - 1990
1 Compiling Joy into silicon: an exercise in applied structura.. (context) - Weber, Bloom et al.
1 Information and Computation (context) - semantics, as et al. - 1992
1 Formal definition of PL/I version (context) - Group - 1986
1 Formal Aspects of Computing (context) - partial, adequate - 1994
1 Theoretical Comput (context) - specifications, premises - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://adam.wins.uva.nl/~x/sos.html): More
A General Conservative Extension Theorem in Process Algebra - Verhoef (1994) (Correct)
A Congruence Theorem for Structured Operational Semantics.. - Baeten, Verhoef (1993) (Correct)
A Congruence Theorem for Structured Operational Semantics With.. - Verhoef (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC