18 search results - page 3 / 4 » From Coalgebraic to Monoidal Traces |
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Jonsson and Larsen's notion of probabilistic simulation is studied from a coalgebraic perspective. The notion is compared with two generic coalgebraic definitions of simulatio...
CORR
2011
Springer
13 years 24 days ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
IANDC
2011
13 years 23 days ago
2011
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
IFIPTCS
2010
13 years 3 months ago
2010
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...
ESOP
2007
Springer
13 years 12 months ago
2007
Springer
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...