Wan Fokkink University of Wales Swansea Department of Computer Science...  Home/Search
Context Related
| swan.ac.uk/compsci/Al...branching.ps.gz 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: swan.ac.uk/compsci/AllS...moreWJF (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote's ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises. 1 Introduction Structural operational semantics [29] and denotational semantics [6] have evolved as the two standard methodologies to provide specification languages,... (Update)
Context of citations to this paper: More
.... congruence formats have been developed for behavioural equivalences based on decorated traces [6, 8, 12, 29] and weak bisimulations [7, 13, 27, 28]. Let a TSS and its signature be extended with new transition rules and function symbols, respectively. The rule formats put...
Cited by: More
Operational semantics for Petri Net components - Groote, Voorhoeve (Correct)
Ordered SOS Process Languages for Branching and Eager.. - Ulidowski, Phillips (2002) (Correct)
Structural Operational Semantics - And Bounded Nondeterminism (Correct)
Similar documents (at the sentence level):
72.1%: Rooted Branching Bisimulation as a Congruence - Fokkink (2000) (Correct)
Active bibliography (related documents): More All
0.6: Conservative Extension in Positive/Negative Conditional Term .. - Fokkink, Verhoef (1998) (Correct)
0.3: Precongruence Formats for Decorated Trace Preorders - Bloom, Fokkink, van Glabbeek (2000) (Correct)
0.3: Language Preorder as a Precongruence - Wan Fokkink (Correct)
Similar documents based on text: More All
0.3: An SOS Message: Conservative Extension in Higher-Order.. - Fokkink, Verhoef (1997) (Correct)
0.2: Operational Conservativity with Binding Terms - Middelburg (Correct)
0.2: Variable Binding Operators in Transition System Specifications - Middelburg (2001) (Correct)
Related documents from co-citation: More All
4: A structural approach to operational semantics - Plotkin - 1981
4: Structured operational semantics and bisimulation as a congruence (context) - Groote, Vaandrager - 1992
2: Higher-level synchronising devices in meije--SCCS (context) - de Simone - 1985
BibTeX entry: (Update)
W. Fokkink. Rooted branching bisimulation as a congruence. Journal of Computer and System Sciences, 60(1):13--37, 2000. http://citeseer.ist.psu.edu/article/fokkink00rooted.html More
@article{ fokkink00rooted,
author = "Wan Fokkink",
title = "Rooted Branching Bisimulation as a Congruence",
journal = "Journal of Computer and System Sciences",
volume = "60",
number = "1",
pages = "13-37",
year = "2000",
url = "citeseer.ist.psu.edu/article/fokkink00rooted.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
906 A structural approach to operational semantics - Plotkin - 1981
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
502 Concurrency and automata on infinite sequences (context) - Park - 1981
312 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
266 Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland - 1990
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
204 the declarative semantics of deductive databases and logic p.. (context) - Przymusinski - 1988
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
125 The well-founded semantics coincides with the three-valued s.. - Przymusinski - 1990
123 A congruence theorem for structured operational semantics wi.. - Baeten, Verhoef - 1993
123 A congruence theorem for structured operational semantics wi.. - Verhoef - 1995
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
104 Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1996
95 The linear time -- branching time spectrum (context) - van Glabbeek - 1990
84 Transition system specifications with negative premises (context) - Groote - 1993
47 The meaning of negative premises in transition system specif.. (context) - Bol, Groote - 1996
45 Syntax and defining equations for an interrupt mechanism (context) - Baeten, Bergstra et al. - 1986
42 A modal characterisation of observable machine-behaviour (context) - Milner - 1981
38 Information and Control (context) - de Bakker, Zucker et al. - 1982
25 Structural operational semantics for weak bisimulations (context) - Bloom - 1995
25 Branching bisimilarity is an equivalence indeed - Basten - 1996
23 ntyxt rules reduce to ntree rules (context) - Fokkink, van Glabbeek - 1996
23 A conservative look at operational semantics with variable b.. - Fokkink, Verhoef - 1998
18 The algebra of communicating processes with empty process (context) - Vrancken - 1997
18 Term-rewriting systems with rule priorities (context) - Baeten, Bergstra et al. - 1989
18 The linear time -- branching time spectrum II: the semantics.. - van Glabbeek - 1993
16 Another look at abstraction (context) - Baeten, van Glabbeek - 1987
16 Bounded nondeterminism and the approximation induction princ.. (context) - van Glabbeek - 1987
13 Full abstraction in structural operational semantics (context) - van Glabbeek - 1993
12 The meaning of negative premises in transition system specif.. - van Glabbeek - 1996
9 Algebraic Techniques for Concurrency and their Application (context) - Vaandrager - 1990
7 Formats of ordered SOS rules with silent actions - Ulidowski, Phillips - 1997
3 Operational semantics of rewriting with priorities - Pol - 1998
3 Language preorder as a precongruence - Fokkink
2 What is branching time and why to use it (context) - van Glabbeek - 1994
Documents on the same site (http://www.swan.ac.uk/compsci/AllStaff/WJFmore/moreWJF.html): More
Lazy Rewriting on Eager Machinery - Fokkink, Kamperman, Walters (1999) (Correct)
A Simple Specification Language Combining Processes, Time and Data - Fokkink (1992) (Correct)
A Logic for Signal Inserted Timed Frames - Bergstra, Fokkink, Middelburg (1996) (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