258 search results - page 11 / 52 » Weak Bisimulation Approximants |
IFIPTCS
2000
15 years 1 months ago
2000
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
ATVA
2004
Springer
15 years 2 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
MFCS
1991
Springer
15 years 1 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
87
Voted
MEMOCODE
2008
IEEE
15 years 3 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...