Sciweavers

427 search results - page 10 / 86
» On the Power of Labels in Transition Systems
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
14 years 11 months ago
Labelled Markov Processes as Generalised Stochastic Relations
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...
Michael W. Mislove, Dusko Pavlovic, James Worrell
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
15 years 6 months ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
ACSD
2010
IEEE
197views Hardware» more  ACSD 2010»
14 years 9 months ago
Order-Independence of Vector-Based Transition Systems
Abstract--Semantics of many specification languages, particularly those used in the domain of hardware, is described in terms of vector-based transition systems. In such a transiti...
Matthias Raffelsieper, Mohammad Reza Mousavi, Hans...
FATES
2006
Springer
15 years 3 months ago
Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems
To efficiently solve safety verification and testing problems for an aspect-oriented system, we use multitape automata to model aspects and propose algorithms for the aspect-orient...
Cheng Li, Zhe Dang
ASE
2008
135views more  ASE 2008»
14 years 11 months ago
Deriving event-based transition systems from goal-oriented requirements models
Goal-oriented methods are increasingly popular for elaborating software requirements. They offer systematic support for incrementally building intentional, structural, and operati...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...