Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective
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...
Main Authors: | Natsuki Urabe, Ichiro Hasuo |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2017-09-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/3226/pdf |
Similar Items
-
Coalgebraic Infinite Traces and Kleisli Simulations
by: Natsuki Urabe, et al.
Published: (2018-09-01) -
Coalgebraic Semantics for Probabilistic Logic Programming
by: Tao Gu, et al.
Published: (2021-04-01) -
Generalizing determinization from automata to coalgebras
by: Alexandra Silva, et al.
Published: (2013-03-01) -
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
by: Marco Bernardo, et al.
Published: (2014-03-01) -
Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
by: Henning Kerstan, et al.
Published: (2013-12-01)