SOS rule formats for convex and abstract probabilistic bisimulations
Probabilistic transition system specifications (PTSSs) in the ntμfθ/ntμxθ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a congruence for all operator defined in such format. Sta...
Main Authors: | Pedro R. D'Argenio, Matias David Lee, Daniel Gebler |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2015-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1508.06710v1 |
Similar Items
-
Tree rules in probabilistic transition system specifications with negative and quantitative premises
by: Pedro R. D'Argenio, et al.
Published: (2012-08-01) -
Compositional bisimulation metric reasoning with Probabilistic Process Calculi
by: Daniel Gebler, et al.
Published: (2017-04-01) -
Logical Characterization of Bisimulation Metrics
by: Valentina Castiglioni, et al.
Published: (2016-10-01) -
Games for Bisimulations and Abstraction
by: David De Frutos Escrig, et al.
Published: (2017-11-01) -
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes
by: Valentina Castiglioni, et al.
Published: (2018-06-01)