Book

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

van Breugel, F., & Worrell, J. (2014). The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (pp. 191–213).

MLA Style

van Breugel, F, and J Worrell. The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata. 2014, pp. 191–213.

Chicago Style

Breugel, F van, and J Worrell. 2014. The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata.
Print

Authors

+ van Breugel, F More by this author

Role:: Author

+ Worrell, J More by this author

Role:: Author

Host title:: Horizons of the Mind. A Tribute to Prakash Panangaden
Pages:: 191-213
Publication date:: 2014-05-01

UUID:: uuid:012bf005-92fb-4b1f-bc8b-9b7f7c82019d
Local pid:: cs:8747
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_012bf00592fb4b1fbc8b9b7f7c82019d

Terms of use

Copyright date:: 2014

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

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

TO TOP