258 search results - page 3 / 52 » Weak Bisimulation Approximants |
CSFW
2003
IEEE
13 years 11 months ago
2003
IEEE
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
ENTCS
2006
13 years 5 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
CONCUR
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
ICFP
1996
ACM
13 years 10 months ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
POLICY
2009
Springer
14 years 9 days ago
2009
Springer
—Access control and privacy policy relations tend to focus on decision outcomes and are very sensitive to defined terms and state. Small changes or updates to a policy language ...