DeepAI AI Chat
Log In Sign Up

Convex Language Semantics for Nondeterministic Probabilistic Automata

05/29/2018
by   Gerco van Heerdt, et al.
0

We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic automata with nondeterminism. For both choices, we show that these automata are strictly more expressive than deterministic probabilistic automata, and we prove that the problem of checking language equivalence is undecidable by reduction from the threshold problem. However, we provide a discounted metric that can be computed to arbitrarily high precision.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/02/2018

Trace Semantics for Nondeterministic Probabilistic Automata via Determinization

This paper studies trace-based equivalences for automata combining nonde...
02/14/2022

Coalgebraic Semantics for Nominal Automata

This paper provides a coalgebraic approach to the language semantics of ...
11/16/2017

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata

We study the bisimilarity problem for probabilistic pushdown automata (p...
01/21/2021

Leafy Automata for Higher-Order Concurrency

Finitary Idealized Concurrent Algol (FICA) is a prototypical programming...
10/29/2018

The problem with probabilistic DAG automata for semantic graphs

Semantic representations in the form of directed acyclic graphs (DAGs) h...
10/20/2019

Checking Timed Bisimulation with Bounded Zone-History Graphs – Technical Report

Timed automata (TA) are a well-established formalism for discrete-state/...
04/13/2018

Constructive Analysis of S1S and Büchi Automata

We study S1S and Büchi automata in the constructive type theory of the C...