Structural Operational Semantics for Weighted Transition Systems

Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A general rule format for the SOS specification of weighted systems is obtained via the coalgebraic approach of Turi and Plotkin. Previously known formats for labelled transition systems (GSOS) and stochastic systems (SGSOS) appear as special cases.

[1]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[2]  Vladimiro Sassone,et al.  Structural Operational Semantics for Stochastic Process Calculi , 2008, FoSSaCS.

[3]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[4]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[5]  S. Lane.  Categories for the Working Mathematician , 1971 .

[6]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[7]  Marco Kick.  Rule Formats for Timed Processes , 2002, Electron. Notes Theor. Comput. Sci..

[8]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[9]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[10]  Peter D. Mosses,et al.  Modular structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[11]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[12]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[13]  Peter D. Mosses.  Foundations of Modular SOS , 1999, MFCS.

[14]  John Power,et al.  Coalgebraic semantics for timed processes , 2006, Inf. Comput..

[15]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

[16]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[17]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[18]  Leszek Pacholski,et al.  Mathematical Foundations of Computer Science 1999 , 1999, Lecture Notes in Computer Science.

[19]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

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

[21]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[22]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[23]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

[24]  Bartek Klin.  Bialgebraic methods and modal logic in structural operational semantics , 2009, Inf. Comput..

[25]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[26]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .