Reasoning About Bounds in Weighted Transition Systems

We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates states that exhibit transitions to bisimulation classes with...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 14, Issue 4
Main Authors:	Hansen, Mikkel, Larsen, Kim Guldstrand, Mardare, Radu, Pedersen, Mathias Ruggaard
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2018
Subjects:	computer science - formal languages and automata theory computer science - logic in computer science f.1.1 f.4.1
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!