Sciweavers

4 search results - page 1 / 1
» Is Timed Branching Bisimilarity an Equivalence Indeed
Sort
View
FORMATS
2005
Springer
13 years 11 months ago
Is Timed Branching Bisimilarity an Equivalence Indeed?
Wan Fokkink, Jun Pang, Anton Wijs
FUIN
2008
89views more  FUIN 2008»
13 years 5 months ago
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
Wan Fokkink, Jun Pang, Anton Wijs
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
13 years 11 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...
CONCUR
2004
Springer
13 years 11 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz