## Precongruence Formats for Decorated Trace Semantics

### Cached

### Download Links

- [homepages.cwi.nl]
- [arxiv.org]
- [boole.stanford.edu]
- [www.cs.vu.nl]
- DBLP

### Other Repositories/Bibliography

Citations: | 18 - 4 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

### OpenURL

### Abstract

### Citations

3499 | Communicating Sequential Processes - Hoare - 1985 |

3275 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ... from each other by means of a wide range of semantic equivalences and preorders. These preorders are based on the branching structure of LTSs (simulation [33], ready simulation [9, 29], bisimulation =-=[31, 33]-=-, nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37], failure pairs [5, 11,... |

1368 |
A Calculus of Communicating Systems
- Milner
- 1980
(Show Context)
Citation Context ...hematical Logic—Modal logic General Terms: Languages, Theory, Verification Additional Key Words and Phrases: Decorated trace semantics, precongruence 1. INTRODUCTION Structural operational semantics [=-=Milner 1980-=-; Plotkin 1981] provides process algebras and specification languages with an interpretation. It generates a (labeled) Authors’ addresses: B. Bloom, IBM T.J. Watson Research Center, Hawthorne, NY 1053... |

1309 | A Structural Approach to Operational Semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...ic—Modal logic General Terms: Languages, Theory, Verification Additional Key Words and Phrases: Decorated trace semantics, precongruence 1. INTRODUCTION Structural operational semantics [Milner 1980; =-=Plotkin 1981-=-] provides process algebras and specification languages with an interpretation. It generates a (labeled) Authors’ addresses: B. Bloom, IBM T.J. Watson Research Center, Hawthorne, NY 10532. W. Fokkink,... |

972 |
Negation as failure
- Clark
- 1987
(Show Context)
Citation Context ...ransition holds if it does not hold. In van Glabbeek [21] the notion of derivability of transitions from a TSS is extended to negated transitions by incorporating a notion of negation as failure (cf. =-=[12]-=-): a supported proof enables one to derive the negation of a transition by disproving a premise in each substitution instance of each transition rule that carries this transition as its conclusion; a ... |

857 | The well-founded semantics for general logic programs
- Gelder, Ross, et al.
- 1991
(Show Context)
Citation Context ...[20] and are planned to appear in a full version of [20]. y Supported by a grant from The Nuffield Foundation.s2 Precongruence Formats for Decorated Trace Semantics work of van Gelder, Ross & Schlipf =-=[18]-=- in logic programming. The notion of completeness of a TSS also coincides with the notion of being positive after reduction of Bol & Groote [10]. LTSs can be distinguished from each other by means of ... |

671 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ... Bol & Groote [10]. LTSs can be distinguished from each other by means of a wide range of semantic equivalences and preorders. These preorders are based on the branching structure of LTSs (simulation =-=[33]-=-, ready simulation [9, 29], bisimulation [31, 33], nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequence... |

499 | Algebraic laws for nondeterminism and concurrency
- Hennessy, Milner
- 1985
(Show Context)
Citation Context ...e holds for the resulting decomposed modal formulas. This implies the desired precongruence result. Larsen [28] and Larsen & Xinxin [30] obtained compositionality results for the HennessyMilner logic =-=[25]-=- and the _-calculus [27], respectively, with respect to action transducers, which constitute a reformulation of TSSs in de Simone's format. The technique for decomposing modal formulas that is employe... |

414 | Bisimulation through probabilistic testing
- Larsen, Skou
- 1991
(Show Context)
Citation Context ...s can be distinguished from each other by means of a wide range of semantic equivalences and preorders. These preorders are based on the branching structure of LTSs (simulation [33], ready simulation =-=[9, 29]-=-, bisimulation [31, 33], nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37]... |

413 | Testing equivalences for processes
- deNicola, Hennessy
- 1983
(Show Context)
Citation Context ...31, 33], nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37], failure pairs =-=[5, 11, 13]-=-, ready traces [3, 36], failure traces [34]). In [19], van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literature, and motivated them by ... |

380 |
Representation of Events in Nerve Nets and Finite Automata
- Kleene
- 1956
(Show Context)
Citation Context ...vial ordering on transition labels, the rule for initial priority is outside de Simone's format, due to the presence of negative premises. 10.3 Binary Kleene star The binary Kleene star t1 \Lambdast2 =-=[26]-=- repeatedly executes t1 until it executes t2. This operational behaviour is captured by the rules in Table 4, which are added to the rules for BPAffi" in Table 1. The resulting positive TSS is in fail... |

365 | Process Algebra for Synchronous Communication
- Bergstra, Klop
- 1984
(Show Context)
Citation Context ...estrictions of the ntyft/ntyxt format are essential as well.s36 Precongruence Formats for Decorated Trace Semantics 9.1 Basic process algebra The examples in this section assume basic process algebra =-=[4]-=-. We assume a collection Act of constants, called atomic actions, representing indivisible behaviour, and two special constants: the deadlock ffi does not display any behaviour, while the empty proces... |

302 |
Results on the Propositional µ-Calculus
- Kozen
- 1983
(Show Context)
Citation Context ...ulas. This implies the desired precongruence result. Larsen [1986] and Larsen and Liu [1991] obtained compositionality results for Hennessy-Milner logic [Hennessy and Milner 1985] and the µ-calculus [=-=Kozen 1982-=-], respectively, with respect to action transducers, which constitute a reformulation of TSSs in de Simone’s format. The technique for decomposing modal formulas that is employed in the current paper ... |

262 |
Results on the propositional -calculus
- Kozen
- 1983
(Show Context)
Citation Context ...g decomposed modal formulas. This implies the desired precongruence result. Larsen [28] and Larsen & Xinxin [30] obtained compositionality results for the HennessyMilner logic [25] and the _-calculus =-=[27]-=-, respectively, with respect to action transducers, which constitute a reformulation of TSSs in de Simone's format. The technique for decomposing modal formulas that is employed in the current paper i... |

196 |
Bisimulation can’t be traced
- Bloom, Istrail, et al.
- 1995
(Show Context)
Citation Context ...s can be distinguished from each other by means of a wide range of semantic equivalences and preorders. These preorders are based on the branching structure of LTSs (simulation [33], ready simulation =-=[9, 29]-=-, bisimulation [31, 33], nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37]... |

191 | F.W.: Structured operational semantics and bisimulation as a congruence - Groote, Vaandrager - 1992 |

115 |
Transition system specifications with negative premises
- Groote
- 1993
(Show Context)
Citation Context ...y de Simone [38], which was extended to the GSOS format by Bloom, Istrail & Meyer [9] and to the tyft/tyxt format by Groote & Vaandrager [24]. The tyft/tyxt format was extended with negative premises =-=[10, 23]-=- to obtain the ntyft/ntyxt format for complete TSSs. The ntyft/ntyxt format also generalizes the GSOS format. The congruence results of [10, 23, 24] were originally only proved for TSSs satisfying a w... |

108 | A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing 2 (2), 274–302. A. Proof of Theorem 9 We show that the problem of deciding whether a universal two-counter machine diverges on inp
- Verhoef
- 1995
(Show Context)
Citation Context ...Ss as well. For this purpose the definitions of the corresponding preorders are extended to 3-valued LTSs. We also prove that the tyft/tyxt format is adequate for the nested simulation preorders. In [=-=Baeten and Verhoef 1993-=-; Verhoef 1995] it was shown that the congruence results and proofs from [Groote and Vaandrager 1992; Groote 1993] can be adapted in a straightforward fashion to accommodate not only binary transition... |

99 | The linear time-branching time spectrum I - the semantics of concrete, sequential processes - Glabbeek - 2001 |

84 |
Specification-oriented Semantics for Communicating Processes.” Automata, Languages, and Programming; 10th Colloquium, vol. 154 of Lecture Notes in Computer Science
- Hoare, Olderog
- 1983
(Show Context)
Citation Context ...ions [Groote and Vaandrager 1992]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [Rounds and Brookes 1981; =-=Olderog and Hoare 1986-=-; Bergstra et al. 1988], failure pairs [Brookes et al. 1984; De Nicola and Hennessy 1984; Bergstra et al. 1988], ready traces [Pnueli 1985; Baeten et al. 1987], failure traces [Phillips 1987]). In [va... |

74 |
Syntax and defining equations for an interrupt mechanism in process algebra
- Baeten, Bergstra, et al.
(Show Context)
Citation Context ...+ ac) and f (ab + ac) are not even completed trace equivalent. 10 Applications This section contains some applications of our precongruence formats to TSSs from the literature. 10.1 Priority Priority =-=[2]-=- is a unary function symbol that assumes an ordering on transition labels. The term \Theta (t) executes the transitions of t, with the restriction that a transition t 0 a \Gamma ! t1 only gives rise t... |

74 |
The meaning of negative premises in transition system specifications
- Bol, Groote
- 1996
(Show Context)
Citation Context ...ated Trace Semantics work of van Gelder, Ross & Schlipf [18] in logic programming. The notion of completeness of a TSS also coincides with the notion of being positive after reduction of Bol & Groote =-=[10]-=-. LTSs can be distinguished from each other by means of a wide range of semantic equivalences and preorders. These preorders are based on the branching structure of LTSs (simulation [33], ready simula... |

73 |
Compositionality through an operational semantics of contexts
- Larsen, Liu
- 1991
(Show Context)
Citation Context ... is within the modal characterization of this preorder, then the same holds for the resulting decomposed modal formulas. This implies the desired precongruence result. Larsen [28] and Larsen & Xinxin =-=[30]-=- obtained compositionality results for the HennessyMilner logic [25] and the _-calculus [27], respectively, with respect to action transducers, which constitute a reformulation of TSSs in de Simone's ... |

64 | Higher-level synchronising devices in Meije-SCCS
- Simone
- 1985
(Show Context)
Citation Context ...mats have helped to avoid repetitive (pre)congruence proofs, and to explore the limits of sensible TSS definitions. A first congruence format for bisimulation equivalence was put forward by de Simone =-=[38]-=-, which was extended to the GSOS format by Bloom, Istrail & Meyer [9] and to the tyft/tyxt format by Groote & Vaandrager [24]. The tyft/tyxt format was extended with negative premises [10, 23] to obta... |

54 | Ntyft/ntyxt rules reduce to ntree rules
- Fokkink, Glabbeek
- 1996
(Show Context)
Citation Context ...mat for complete TSSs. The ntyft/ntyxt format also generalizes the GSOS format. The congruence results of [10, 23, 24] were originally only proved for TSSs satisfying a well-foundedness criterion; in =-=[17]-=- they were shown to hold for all complete TSSs in ntyft/ntyxt format. To mention some formats for other equivalences and preorders, Vaandrager [39] observed that de Simone's format is a precongruence ... |

47 |
Refusal testing
- Phillips
- 1987
(Show Context)
Citation Context ... Olderog and Hoare 1986; Bergstra et al. 1988], failure pairs [Brookes et al. 1984; De Nicola and Hennessy 1984; Bergstra et al. 1988], ready traces [Pnueli 1985; Baeten et al. 1987], failure traces [=-=Phillips 1987-=-]). In [van Glabbeek 2001], most equivalences and preorders for concrete, sequential processes 1 that occur in the literature were classified and motivated by means of testing scenarios, phrased in te... |

41 | On the relationship between process algebra and input/output automata
- Vaandrager
- 1991
(Show Context)
Citation Context ...for TSSs satisfying a well-foundedness criterion; in [17] they were shown to hold for all complete TSSs in ntyft/ntyxt format. To mention some formats for other equivalences and preorders, Vaandrager =-=[39]-=- observed that de Simone’s format is a precongruence format for the partial trace and the failure preorders, Bloom [7] introduced a more general congruence format for partial trace equivalence, and Fo... |

38 | R.: The meaning of negative premises in transition system specifications II - Glabbeek - 2004 |

35 |
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
- FAGES
- 1991
(Show Context)
Citation Context ... by disproving a premise in each substitution instance of each transition rule that carries this transition as its conclusion; a well-supported proof (inspired by the notion of a well-supported model =-=[14]-=-) features an even more powerful method to derive the negation of a transition by demonstrating that that transition can not be derived. A TSS is complete [21] if for each transition there is a well-s... |

34 |
Context Dependent Bisimulations Between Processes
- Larsen
- 1986
(Show Context)
Citation Context ...s that if a modal formula is within the modal characterization of this preorder, then the same holds for the resulting decomposed modal formulas. This implies the desired precongruence result. Larsen =-=[28]-=- and Larsen & Xinxin [30] obtained compositionality results for the HennessyMilner logic [25] and the _-calculus [27], respectively, with respect to action transducers, which constitute a reformulatio... |

31 |
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
- PNUELI
- 1985
(Show Context)
Citation Context ...s [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37], failure pairs [5, 11, 13], ready traces =-=[3, 36]-=-, failure traces [34]). In [19], van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literature, and motivated them by means of testing scena... |

27 |
Ready-trace semantics for concrete process algebra with a priority operator
- BAETEN, BERGSTRA, et al.
- 1987
(Show Context)
Citation Context ...s [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37], failure pairs [5, 11, 13], ready traces =-=[3, 36]-=-, failure traces [34]). In [19], van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literature, and motivated them by means of testing scena... |

25 |
The algebra of communicating processes with empty process
- Vrancken
- 1997
(Show Context)
Citation Context ... assume a collection Act of constants, called atomic actions, representing indivisible behaviour, and two special constants: the deadlock ffi does not display any behaviour, while the empty process " =-=[40]-=- terminates successfully. Basic process algebra moreover includes function symbols + and \Deltasof arity two, called alternative composition and sequential composition, respectively. Intuitively, t1 +... |

24 | A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces
- Aceto, Fokkink, et al.
- 1998
(Show Context)
Citation Context ...ary 8 The n-nested simulation (for n * 1), ready simulation, ready trace, readiness, failure trace and failure preorders are precongruences w.r.t. BPAffi" with the binary Kleene star. It was noted in =-=[1]-=- that the second rule for the binary Kleene star does not fit the congruence format for ready trace equivalence from [20]. Namely, in this rule the variables x1 and y in the target are connected by th... |

22 |
Readies and failures in the algebra of communicating processes
- Bergstra, Klop, et al.
- 1988
(Show Context)
Citation Context ...ion [9, 29], bisimulation [31, 33], nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs =-=[5, 32, 37]-=-, failure pairs [5, 11, 13], ready traces [3, 36], failure traces [34]). In [19], van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literat... |

19 | Full abstraction in structural operational semantics
- Glabbeek
- 1993
(Show Context)
Citation Context ...esent, absent or unknown. This approach to the meaning of transition system specifications can be seen as a proof-theoretic characterization of the \LambdasThis paper subsumes most of [6] and part of =-=[20]-=-. An extended abstract of our work appeared as [8], except that in the current paper we do not include the full abstraction results mentioned there. Those results originated from [20] and are planned ... |

19 |
Possible futures, acceptances, refusals and communicating processes
- Rounds, Brookes
- 1981
(Show Context)
Citation Context ...ion [9, 29], bisimulation [31, 33], nested simulations [24]), on execution sequences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs =-=[5, 32, 37]-=-, failure pairs [5, 11, 13], ready traces [3, 36], failure traces [34]). In [19], van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literat... |

15 | Rooted branching bisimulation as a congruence
- Fokkink
(Show Context)
Citation Context ...econgruence formats for the ready trace preorder, the readiness preorder, the failure trace preorder and the failure preorder. The precongruence formats for the last two preorders coincide. Following =-=[6, 15, 16]-=-, these three precongruence formats distinguish between frozen and liquid arguments of function symbols. This distinction is used in posing restrictions on occurrences of variables in transition rules... |

14 |
Glabbeek (2001): The Linear Time – Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes
- van
(Show Context)
Citation Context ...artial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37], failure pairs [5, 11, 13], ready traces [3, 36], failure traces [34]). In =-=[19]-=-, van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literature, and motivated them by means of testing scenarios, phrased in terms of `butt... |

13 |
Refinement in branching time semantics
- Glabbeck, Weijland
- 1989
(Show Context)
Citation Context ...ailure traces but that lies outside the scope of the failure trace format. 10.5 Action refinement The binary action refinement operator t1[a → t2] for atomic actions a, based on a similar operator in =-=[22]-=-, replaces each a transition in t1 by t2. Its transition rules are presented in Table 6, which are added to the rules for BPA ; 0 in Table 5. If we take the first argument of sequencing and of action ... |

5 |
Refusal testing. Theoretical Computer Science, 50(3):241–284
- Phillips
- 1987
(Show Context)
Citation Context ...quences (partial traces, completed traces, accepting traces), or on decorated versions of execution sequences (ready pairs [5, 32, 37], failure pairs [5, 11, 13], ready traces [3, 36], failure traces =-=[34]-=-). In [19], van Glabbeek classified most equivalences and preorders for concrete, sequential processes 1 that occur in the literature, and motivated them by means of testing scenarios, phrased in term... |

5 |
When is partial trace equivalence adequate
- Bloom
- 1994
(Show Context)
Citation Context ... single constant 0. The transition rules for BPA ; 0 are presented in Table V, where v and w range over Act. This standard TSS is in ready simulation format. The rules for sequencing were taken from [=-=Bloom 1994-=-]. Table V. Transitions rules for BPA ; 0 v v −→ 0 v x1 −→ y v x1 + x2 −→ y v x1 −→ y v x1; x2 −→ y; x2 v x2 −→ y v x1 + x2 −→ y x1 � v w −→ for v ∈ Act x2 −→ y w x1; x2 −→ y As the floating variable ... |

4 | Language preorder as a precongruence
- Fokkink
(Show Context)
Citation Context ...ved that de Simone's format is a precongruence format for the partial trace and the failure preorders, Bloom [7] introduced a more general congruence format for partial trace equivalence, and Fokkink =-=[15]-=- introduced a precongruence format for the accepting trace preorder. Finally, Bloom [6] introduced a congruence format for readiness equivalence, and van Glabbeek [20] one for ready simulation equival... |

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
(Show Context)
Citation Context ...ns are either present, absent or unknown. This approach to the meaning of transition system specifications can be seen as a proof-theoretic characterization of the \LambdasThis paper subsumes most of =-=[6]-=- and part of [20]. An extended abstract of our work appeared as [8], except that in the current paper we do not include the full abstraction results mentioned there. Those results originated from [20]... |

2 |
When is partial trace equivalence adequate? Formal Aspects of Computing 6
- Bloom
- 1994
(Show Context)
Citation Context ...format. To mention some formats for other equivalences and preorders, Vaandrager [39] observed that de Simone's format is a precongruence format for the partial trace and the failure preorders, Bloom =-=[7]-=- introduced a more general congruence format for partial trace equivalence, and Fokkink [15] introduced a precongruence format for the accepting trace preorder. Finally, Bloom [6] introduced a congrue... |

1 |
Glabbeek (2000): Precongruence formats for decorated trace preorders
- Bloom, Fokkink, et al.
(Show Context)
Citation Context ...ing of transition system specifications can be seen as a proof-theoretic characterization of the \LambdasThis paper subsumes most of [6] and part of [20]. An extended abstract of our work appeared as =-=[8]-=-, except that in the current paper we do not include the full abstraction results mentioned there. Those results originated from [20] and are planned to appear in a full version of [20]. y Supported b... |

1 |
Precongruence Formats for Decorated Trace Semantics De
- Nicola, Hennessy
- 1984
(Show Context)
Citation Context ...traces, accepting traces), or on decorated versions of execution sequences (ready pairs [Rounds and Brookes 1981; Olderog and Hoare 1986; Bergstra et al. 1988], failure pairs [Brookes et al. 1984; De =-=Nicola and Hennessy 1984-=-; Bergstra et al. 1988], ready traces [Pnueli 1985; Baeten et al. 1987], failure traces [Phillips 1987]). In [van Glabbeek 2001], most equivalences and preorders for concrete, sequential processes 1 t... |

1 | Language preorder as a precongruence. Theor - Fokkink |

1 | Eds. Workshops in Computing - Nivat, Rattray, et al. - 2004 |