论文信息 - Taxonomy and Expressiveness of Preemption: A Syntactic Approach

Taxonomy and Expressiveness of Preemption: A Syntactic Approach

We propose a taxonomy of preemptive (suspensive and abortive) operators capturing the intuition of such operators that exist in the various synchronous languages. Some of the main contributions of the paper are: a precise notion of preemption is established at a structural level; we show that the class of suspensive operators is strictly more expressive than abortive operators, and we show that suspension is primitive while abortion is not

[1] Philippe Darondeau,et al. Structural Operational Specifications and the Trace Automata , 1992, CONCUR.

[2] Robin Milner,et al. A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[3] Robert de Simone,et al. Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[4] Albert R. Meyer,et al. Bisimulation can't be traced , 1988, POPL '88.

[5] Arend Rensink. Bisimilarity of open terms , 1997, EXPRESS.

[6] Jan Friso Groote,et al. Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) , 1989, ICALP.

[7] Kim G. Larsen,et al. Compositional Theories Based on an Operational Semantics of Contexts , 1989, REX Workshop.

[8] Sophie Pinchinat,et al. Ordinal Processes in Comparative Concurrency Semantics , 1991, CSL.

[9] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[10] Robin Milner,et al. Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[11] Gérard Berry,et al. Preemption in Concurrent Systems , 1993, FSTTCS.

[12] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[13] Robin Milner,et al. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..