scientific article; zbMATH DE number 7318983

MaRDI QIDQ4965819zbMATH OpenFDO

Authors Mathieu Tracol, Josée Desharnais, Abir Zhioua

Publication date 10 March 2021

Full work available at URL https://arxiv.org/abs/1107.1206, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2011.11

Mathematics Subject Classification ID

Logic in computer science (03B70) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the Computation of Some Standard Distances Between Probabilistic Automata
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computation of distances for regular and context-free probabilistic languages
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Approximate comparison of distance automata
• On the computational complexity of approximating distributions by probabilistic automata
• Approximating and computing behavioural distances in probabilistic transition systems

Cited in

(17)

• SOS specifications for uniformly continuous operators
• \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
• Polynomial-time algorithms for computing distances of fuzzy transition systems
• Towards general axiomatizations for bisimilarity and trace semantics
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Unwinding biological systems
• Group-by-group probabilistic bisimilarities and their logical characterizations
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• scientific article; zbMATH DE number 7360012 (Why is no real title available?)
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Computing probabilistic bisimilarity distances for probabilistic automata
• Back to the format: a survey on SOS for probabilistic processes
• A spectrum of approximate probabilistic bisimulations
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965819)