Impossible futures and determinism

@article{Voorhoeve2001ImpossibleFA,
  title={Impossible futures and determinism},
  author={M. Voorhoeve and S. Mauw},
  journal={Inf. Process. Lett.},
  year={2001},
  volume={80},
  pages={51-58}
}
  • M. Voorhoeve, S. Mauw
  • Published 2001
  • Economics, Mathematics, Computer Science
  • Inf. Process. Lett.
  • Abstract We present a class ⪯ n of process preorders related to contrasimulation equivalence and characterize the predicates they preserve. For the preorder ⪯ 2 (impossible futures) an axiomatization is given. 
    30 Citations

    Figures, Tables, and Topics from this paper

    Impossible futures and determinism
    • 30
    • PDF
    On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
    • 2
    • Highly Influenced
    • PDF
    A Semantic Preorder on Refinement and Fairness
    • X. W. Huang, L. Jiao, W. Lu
    • Computer Science
    • First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)
    • 2007
    Liveness, Fairness and Impossible Futures
    • 14
    • PDF
    On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
    • T. Chen, W. Fokkink
    • Computer Science, Mathematics
    • 2008 23rd Annual IEEE Symposium on Logic in Computer Science
    • 2008
    • 13
    • PDF
    Axiomatizing weak simulation semantics over BCCSP
    • 4
    • PDF
    On the Axiomatizability of Impossible Futures
    • 2
    • PDF
    A Context-Free Process as a Pushdown Automaton
    • 17

    References

    SHOWING 1-10 OF 73 REFERENCES
    Impossible futures and determinism
    • 30
    • PDF
    Testing Equivalences for Processes
    • 1,286
    • PDF
    Termination in timed process algebra
    • 16
    • PDF
    Concrete process algebra
    • 111
    • PDF
    Possible futures, acceptances, refusals, and communicating processes
    • W. Rounds, S. Brookes
    • Mathematics, Computer Science
    • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
    • 1981
    • 69
    Bisimulation can't be traced
    • 405
    • PDF
    Divergence and Fair Testing
    • 100
    Deadlock Behaviour in Split and ST Bisimulation Semantics
    • 57
    • PDF
    The Linear Time - Branching Time Spectrum II
    • 738
    Process algebra with interleaving probabilistic parallel composition
    • 41
    • PDF