49 search results - page 2 / 10 » Mixed Transition Systems Revisited |
FOSSACS
2008
Springer
13 years 6 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...
ACTA
2007
13 years 5 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
APSEC
2005
IEEE
13 years 11 months ago
2005
IEEE
— In this paper, we present a temporal logic called F whose interpretation is over Input Output Symbolic Transition Systems (IOSTS). IOSTS extend transition systems to communicat...
CORR
2011
Springer
13 years 8 days ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...