Precongruence Formats for Decorated Trace Semantics

Precongruence Formats for Decorated Trace Semantics

Cached

Download Links

[homepages.cwi.nl]
[boole.stanford.edu]
[www.cs.vu.nl]

Other Repositories/Bibliography

DBLP

by Bard Bloom , Wan Fokkink , Rob J. van Glabbeek

Citations:

15 - 3 self

BibTeX

@MISC{Bloom_precongruenceformats,
    author = {Bard Bloom and Wan Fokkink and Rob J. van Glabbeek},
    title = {Precongruence Formats for Decorated Trace Semantics},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

3118	Communicating sequential processes - Hoare - 1978
2971	Communication and Concurrency - Milner - 1989
1225	A calculus of communicating systems - Milner - 1980
1182	A structural approach to operational semantics - Plotkin - 1981
855	Negation as Failure - Clark - 1978
743	The Well-Founded Semantics for General Logic Programs - Gelder, Ross, et al. - 1991
599	Concurrency and automata on infinite sequences - Park - 1981
448	Algebraic laws for nondeterminism and concurrency - Hennessy, Milner - 1985
371	A.: Bisimulation through Probabilistic Testing - Larsen, Skou - 1991
363	M.: Testing Equivalences for Processes - Nicola, Hennessy - 1984
331	Process algebra for synchronous communication - Bergstra, Klop - 1984
318	Representation of events in nerve nets and finite automata - Kleene - 1956
259	Results on the propositional _-calculus - Kozen - 1983
255	Results on the propositional µ-calculus - Kozen - 1983
183	Structured operational semantics and bisimulation as a congruence - Groote, Vaandrager - 1992
169	Bisimulation Can’t Be Traced - Bloom, Istrael, et al. - 1995
107	Transition System Specification with Negative Premises - Groote - 1990
103	A congruence theorem for structured operational semantics with predicates - Baeten, Verhoef - 1993
82	Specification-oriented semantics for communicating processes - Olderog, Hoare - 1986
77	The linear time - branching time spectrum I; the semantics of concrete, sequential processes - Glabbeek - 2001
70	Compositionality through an operational semantics of contexts - Larsen, Xinxin - 1991
69	Syntax and defining equations for an interrupt mechanism in process algebra - BAETEN, BERGSTRA, et al. - 1986
69	The Meaning of Negative Premises in Transition System Specifications - Bol, Groote - 1996
58	R.: Higher-Level Synchronising Devices in Meije-SCCS - Simone - 1985
54	Ntyft/ntyxt rules reduce to ntree rules - Fokkink, Glabbeek - 1995
40	Refusal Testing - Phillips - 1987
35	The meaning of negative premises in transition system specifications II - Glabbeek - 1995
35	On the Relationship Between Process Algebra and Input/Output Automata (Extended Abstract - Vaandrager - 1991
32	A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics - Fages - 1990
31	Context Dependent Bisimulation Between Processes - Larsen - 1986
29	and branching structures in the semantics and logics of reactive systems - Pnueli, Linear - 1985
24	A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces - Aceto, Fokkink, et al. - 1998
24	The algebra of communicating processes with empty process - Vrancken - 1997
22	Readies and failures in the algebra of communicating processes - Bergstra, Klop, et al. - 1988
21	Ready-trace semantics for concrete process algebra with the priority operator - Baeten, Bergstra, et al. - 1987
19	Full abstraction in structural operational semantics - Glabbeek - 1993
16	Possible futures, acceptances, refusals and communicating processes - Rounds, Brookes - 1981
12	2000): Rooted branching bisimulation as a congruence - Fokkink
12	Refinement in branching time semantics - Glabbeek, Weijland - 1989
8	Glabbeek (2001): The linear time – branching time spectrum I. The semantics of concrete, sequential processes - van
5	When is partial trace equivalence adequate - Bloom - 1994
4	Language preorder as a precongruence - Fokkink
4	Refusal testing. Theoretical Computer Science 50 - Phillips - 1987
4	Precongruence formats for decorated trace preorders - Bloom, Fokkink, et al. - 2000
2	Ready, set, go: structural operational semantics for linear-time process algebras - Bloom - 1993
2	When is partial trace equivalence adequate? Formal Aspects of Computing 6 - Bloom - 1994
1	Glabbeek (2000): Precongruence formats for decorated trace preorders - Bloom, Fokkink, et al.
1	Precongruence Formats for Decorated Trace Semantics De - Nicola, Hennessy - 1984
1	Language preorder as a precongruence. Theor - Fokkink
1	Eds. Workshops in Computing - Nivat, Rattray, et al. - 2004