Andrea Turrini and Probabilistic Automata - Free people check

(1 - 11 from 13

)

!!Holger Hermanns - Publications \\ Ernst Moritz Hahn, Arnd ...

www.ae-info.org

Petri Nets 2013: Holger Hermanns, Andrea Turrini: Cost Preserving Bisimulations for Probabilistic Automata. CONCUR 2013: Holger ...

Publications | MEALS

meals-project.eu

Filters: Author is Andrea Turrini [Clear All Filters] H. Hermanns and A. Turrini, “Cost Preserving Bisimulations for Probabilistic Automata”, in CONCUR ...

[ ] Cost Preserving Bisimulations for Probabilistic Automata

arxiv.org

Oct 30, · Title: Cost Preserving Bisimulations for Probabilistic Automata. Authors: ... From: Andrea Turrini Thu, 30 Oct :26:58 GMT (55kb) Wed, 17 …

The Algorithmics of Probabilistic Automata Weak Bisimulation Andrea...

pdfslide.us

Slide 1 The Algorithmics of Probabilistic Automata Weak Bisimulation Andrea Turrini Saarland University based on a joint work with Holger Hermanns Slide 2...

[ v1] Deciding Probabilistic Automata Weak Bisimulation in...

arxiv.org

Authors: Holger Hermanns, Andrea Turrini. (Submitted on 2 May (this version), latest version 15 Jul (v2)). Abstract: Deciding in an ...

Andrea Turrini - DBLPdblp.org › Persons

dblp.org

List of computer science publications by Andrea Turrini Andrea Turrini, Holger Hermanns: Polynomial time decision algorithms for probabilistic automata ...

The Quest for Minimal Quotients for Probabilistic Automata |...

link.springer.com

One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity....

Cost Preserving Bisimulations for Probabilistic Automata |...

link.springer.com

Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting...

All web results to the name "Andrea Turrini"

The Algorithmics of Probabilistic Automata Weak Bisimulation ...slideplayer.com › slide

slideplayer.com

Andrea Turrini Saarland University Probabilistic Automata (PA) PA = (Q, q 0, E, H, D) Transition relation D Q (E ) (Q) Internal ...

au:Turrini_A in:cs - SciRate Search

scirate.com

Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting ...

Cost Preserving Bisimulations for Probabilistic Automata - Semantic ...www.semanticscholar.org › paper › Cost-Preserving-Bisimulations-for-Pro...

www.semanticscholar.org

View 1 excerpt. Polynomial time decision algorithms for probabilistic automata · Andrea Turrini, H. Hermanns. Computer Science, Mathematics; Inf. Comput.

Related search requests for Andrea Turrini

Ernst Moritz
Ernst Moritz Hahn
Christelle Braun

Moritz Hahn

People
Forename "Andrea" (83104)
Name "Turrini" (145)

sorted by relevance / date

Advanced Search

Search name: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Andrea Turrini and Probabilistic Automata Free People Check