Abstract Probabilistic Automata (Q3075492): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:15, 3 July 2024

scientific article

Language	Label	Description	Also known as
English	Abstract Probabilistic Automata	scientific article

Statements

scholarly article

0 references

Abstract Probabilistic Automata (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-18275-4_23

0 references

Benoît Delahaye

0 references

0 references

Mikkel L. Pedersen

0 references

0 references

Andrzej Wąsowski

0 references

Joost-Pieter Katoen

0 references

Kim Guldstrand Larsen

0 references

Lecture Notes in Computer Science

0 references

publication date

15 February 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-18275-4_23

0 references

0 references

Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

0 references

Analyzing security protocols using time-bounded task-PIOAs

0 references

0 references

Switched PIOA: parallel composition via distributed scheduling

0 references

A testing scenario for probabilistic processes

0 references

Model Checking Software

0 references

A Probabilistic Extension of UML Statecharts

0 references

Three-Valued Abstraction for Continuous-Time Markov Chains

0 references

Compositional Abstraction for Stochastic Systems

0 references

Modal I/O Automata for Interface and Product Line Theories

0 references

Probability and Nondeterminism in Operational Models of Concurrency

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3075492

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3075492&oldid=35214326"