Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective

Natsuki Urabe ; Ichiro Hasuo.
Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion. They have been comprehensively studied by Lynch and Vaandrager for nondeterministic and timed systems; for B\"{u}chi automata the notion of fair&nbsp;[&hellip;]
Published on September 6, 2017

Coalgebraic Infinite Traces and Kleisli Simulations

Natsuki Urabe ; Ichiro Hasuo.
Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli simulation has been developed and it guarantees the&nbsp;[&hellip;]
Published on September 5, 2018

  • < Previous
  • 1
  • Next >