Journal article icon

Journal article

Probabilistic Logical Characterization

Abstract:

Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. We consider logical characterizations of bisimulation and ...

Expand abstract

Actions


Authors


Holger Hermanns More by this author
Augusto Parma More by this author
Roberto Segala More by this author
Björn Wachter More by this author
Lijun Zhang More by this author
Journal:
Information and Computation
Publication date:
2011
URN:
uuid:25890be1-d039-4822-a65f-af97a368983b
Local pid:
cs:3794

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP