Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of “non-determinism ” such as classical non-determinism (with a set of possible choices) vs. probabilistic nondeterminism. In this paper we claim that these various forms of “trace semantics” are instances of a single categorical construction, namely coinduction in a Kleisli category. This claim is based on our main technical result that an initial algebra i
In the concurrency theory, various semantic equivalences on transition systems are based on traces d...
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) ...
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic...
AbstractTrace semantics has been defined for various non-deterministic systems with different input/...
Trace semantics has been defined for various kinds of state-based systems, notably with different fo...
Trace semantics has been defined for various kinds of state-based systems,notably with different for...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
International audienceThis paper takes a fresh look at the topic of trace semantics in the theory of...
Coalgebras in a Kleisli category yield a generic definition of tracesemantics for various types of l...
AbstractUsing simple systems with a notion of discrete deterministic evolution over time, we study d...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...
International audienceIn the theory of coalgebras, trace semantics can be defined in various distinc...
In the concurrency theory, various semantic equivalences on transition systems are based on traces d...
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) ...
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic...
AbstractTrace semantics has been defined for various non-deterministic systems with different input/...
Trace semantics has been defined for various kinds of state-based systems, notably with different fo...
Trace semantics has been defined for various kinds of state-based systems,notably with different for...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
International audienceThis paper takes a fresh look at the topic of trace semantics in the theory of...
Coalgebras in a Kleisli category yield a generic definition of tracesemantics for various types of l...
AbstractUsing simple systems with a notion of discrete deterministic evolution over time, we study d...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...
International audienceIn the theory of coalgebras, trace semantics can be defined in various distinc...
In the concurrency theory, various semantic equivalences on transition systems are based on traces d...
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) ...
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic...