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...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 14, Issue 4
Hlavní autori:	Hansen, Mikkel, Larsen, Kim Guldstrand, Mardare, Radu, Pedersen, Mathias Ruggaard
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 01.01.2018
Predmet:	computer science - formal languages and automata theory computer science - logic in computer science f.1.1 f.4.1
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!