Parameterized Structured Operational Semantics
暂无分享,去创建一个
[1] Jan Friso Groote. Transition System Specifications with Negative Premises (Extended Abstract) , 1990, CONCUR.
[2] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[3] Robert de Simone,et al. Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..
[4] Jos C. M. Baeten,et al. A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.
[5] Jan J. M. M. Rutten. Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..
[6] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[7] Corrado Priami,et al. Enhanced operational semantics , 1996, CSUR.
[8] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[9] Robin Milner,et al. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..
[10] Luca Aceto,et al. CPO Models for Compact GSOS Languages , 1996, Inf. Comput..
[11] Luca Aceto,et al. GSOS and Finite Labelled Transition Systems , 1994, Theor. Comput. Sci..
[12] Corrado Priami,et al. Causality for Mobile Processes , 1995, ICALP.
[13] Gian Luigi Ferrari,et al. The Weak Late pi-Calculus Semantics as Observation Equivalence , 1995, CONCUR.
[14] Luca Aceto,et al. Termination, deadlock, and divergence , 1992, JACM.
[15] Gian Luigi Ferrari,et al. A Pi-Calculus with Explicit Substitutions , 1996, Theor. Comput. Sci..
[16] Rob J. van Glabbeek. Full Abstraction in Structural Operational Semantics (Extended Abstract) , 1993, AMAST.
[17] Xinxin Liu,et al. Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.
[18] Luca Aceto,et al. Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours , 1994, CONCUR.
[19] Gian Luigi Ferrari,et al. The Observation Algebra of Spatial Pomsets , 1991, CONCUR.
[20] Bard Bloom,et al. Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..
[21] Frits W. Vaandrager,et al. Turning SOS Rules into Equations , 1994, Inf. Comput..
[22] Jan A. Bergstra,et al. A complete inference system for rgular processes with silent moves , 1984 .
[23] Frits W. Vaandrager,et al. Expressive Results for Process Algebras , 1992, REX Workshop.
[24] Jan A. Bergstra,et al. Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..
[25] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..
[26] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..
[27] Marek Antoni Bednarczyk,et al. Categories of asynchronous systems , 1987 .
[28] Ugo Montanari,et al. Location Equivalence in Parametric Setting , 1995, Theor. Comput. Sci..
[29] Matthew Hennessy,et al. Observing Localities , 1993, Theor. Comput. Sci..
[30] Irek Ulidowski,et al. Axiomatisations of Weak Equivalences for De Simone Languages , 1995, CONCUR.