427 search results - page 25 / 86 » On the Power of Labels in Transition Systems |
108
click to vote
ENTCS
2007
14 years 11 months ago
2007
We introduce a hybrid variant of a dynamic logic with continuous state transitions along differential equations, and we present a sequent calculus for this extended hybrid dynami...
101
click to vote
JALC
2006
14 years 11 months ago
2006
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
110
click to vote
UTP
2010
14 years 9 months ago
2010
Abstract. The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing fo...
ACSD
2009
IEEE
15 years 3 months ago
2009
IEEE
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...