20 search results - page 2 / 4 » Opacity Generalised to Transition Systems |
ENTCS
2007
13 years 5 months ago
2007
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
ATAL
2000
Springer
13 years 9 months ago
2000
Springer
In this paper, we describe a framework to program open societies of concurrently operating agents. The agents maintain a subjective theory about their environment and interact with...
ENTCS
2002
13 years 5 months ago
2002
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
CORR
2011
Springer
13 years 13 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...
ENTCS
2006
13 years 5 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...