Tree rules in probabilistic transition system specifications with negative and quantitative premises

MaRDI QIDQ4986263zbMATH OpenFDO

Authors Matias David Lee, Daniel Gebler, P. R. D'Argenio

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2752, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS12.9

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• SOS rule formats for convex and abstract probabilistic bisimulations
• A general SOS theory for the specification of probabilistic transition systems
• Probabilistic transition system specification: congruence and full abstraction of bisimulation
• GSOS for probabilistic transition systems (extended abstract)
• Transition system specifications with negative premises

Cited in

(7)

• The meaning of negative premises in transition system specifications. II
• Back to the format: a survey on SOS for probabilistic processes
• A general SOS theory for the specification of probabilistic transition systems
• SOS specifications for uniformly continuous operators
• Structural operational semantics for non-deterministic processes with quantitative aspects
• SOS rule formats for convex and abstract probabilistic bisimulations
• scientific article; zbMATH DE number 176757 (Why is no real title available?)

This page was built for publication: Tree rules in probabilistic transition system specifications with negative and quantitative premises

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986263)