Bard Bloom, Wan Fokkink, Rob van Glabbeek  Home/Search
Context Related
| stanford.edu/pub/lics2000.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: stanford.edu/people/r...abstracts (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system speci cations using Plotkin's structural approach. For several preorders in the linear time { branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators speci- able in that format. The formats are derived using the modal... (Update)
Context of citations to this paper: More
...[10, 17, 18] formats. Furthermore, 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,...
Cited by: More
Structural Operational Semantics - And Bounded Nondeterminism (Correct)
Similar documents (at the sentence level):
51.8%: Precongruence Formats for Decorated Trace Preorders - Bloom, Fokkink, van Glabbeek (2000) (Correct)
23.4%: Precongruence Formats for Decorated Trace - Semantics Bard Bloom (Correct)
Active bibliography (related documents): More All
0.6: SOS Rule Formats for Parameterized and State-Bearing Processes - Bloom, Vaandrager (1995) (Correct)
0.5: Rooted Branching Bisimulation as a Congruence - Fokkink (2000) (Correct)
0.4: Axiomatizing GSOS with termination - Baeten, de Vink (Correct)
Similar documents based on text: More All
0.4: On the Axiomatizability of Ready Traces, - Ready Simulation And (Correct)
0.4: On Full Abstractness for Fair Testing - Natarajan, Cleaveland (1996) (Correct)
0.4: The Meaning of Negative Premises - In Transition System (Correct)
BibTeX entry: (Update)
B. Bloom, W. Fokkink, and R. van Glabbeek. Precongruence formats for decorated trace preorders. In Proceedings 15th Symposium on Logic in Computer Science, Santa Barbara, California, pages 107--118. IEEE Computer Society Press, 2000. http://citeseer.ist.psu.edu/bloom00precongruence.html More
@inproceedings{ bloom00precongruence,
author = "Bard Bloom and Wan Fokkink and Rob J. van Glabbeek",
title = "Precongruence Formats for Decorated Trace Preorders",
booktitle = "Logic in Computer Science",
pages = "107-118",
year = "2000",
url = "citeseer.ist.psu.edu/bloom00precongruence.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
906 A structural approach to operational semantics - Plotkin - 1981
759 Negation as failure (context) - Clark - 1978
312 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
231 A theory of communicating sequential processes (context) - Brookes, Hoare et al. - 1984
218 Process algebra for synchronous communication (context) - Bergstra, Klop - 1984
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
168 Testing equivalences for processes (context) - De Nicola, Hennessy - 1984
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
67 Linear and branching structures in the semantics and logics .. (context) - Pnueli - 1985
48 Higher-level synchronising devices in Meije-SCCS (context) - de Simone - 1985
47 The meaning of negative premises in transition system specic.. (context) - Bol, Groote - 1996
44 Theoretical Computer Science (context) - Phillips, testing - 1987
37 the relationship between process algebra and input/output au.. - Vaandrager - 1991
29 Representation of events in nerve nets and nite automata (context) - Kleene - 1956
23 Transition system specications with negative premises (context) - Groote - 1993
23 ntyxt rules reduce to ntree rules (context) - Fokkink, van Glabbeek - 1996
21 branching time spectrum (context) - van Glabbeek, time - 1990
18 The algebra of communicating processes with empty process (context) - Vrancken - 1997
17 Ready-trace semantics for concrete process algebra with the .. (context) - Baeten, Bergstra et al. - 1987
13 Full abstraction in structural operational semantics (context) - Bloom, Fokkink et al. - 2000
13 Full abstraction in structural operational semantics (context) - van Glabbeek - 1993
9 go: structural operational semantics for linear-time process.. (context) - Bloom, set - 1993
4 When is partial trace equivalence adequate (context) - Bloom - 1994
4 Specication -oriented semantics for communicating processes (context) - Olderog, Hoare - 1986
3 Syntax and dening equations for an interrupt mechanism (context) - Baeten, Bergstra et al. - 1986
2 Theoretical Computer Science (context) - Fokkink, as et al.
Documents on the same site (http://theory.stanford.edu/people/rvg/abstracts.html): More
Bisimulation - van Glabbeek (Correct)
Branching Bisimulation as a Tool in the Analysis of Weak.. - van Glabbeek (1995) (Correct)
The Linear Time-Branching Time Spectrum I - The Semantics of.. - van Glabbeek (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