A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933): Difference between revisions

Latest revision as of 02:24, 7 July 2024

scientific article

Language	Label	Description	Also known as
English	A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences	scientific article

Statements

instance of

scholarly article

0 references

title

A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (English)

0 references

0 references

0 references

0 references

Information and Computation

0 references

publication date

29 November 2013

0 references

zbMATH Keywords

labeled transition systems

0 references

discrete-/continuous-time Markov chains

0 references

discrete-/continuous-time Markov decision processes

0 references

bisimulation equivalences

0 references

trace equivalences

0 references

testing equivalences

0 references

describes a project that uses

PEPA

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ic.2013.02.004

0 references

cites work

Observation equivalence as a testing equivalence

0 references

Equational Axioms for Probabilistic Bisimilarity

0 references

Q3394898

0 references

A theory of timed automata

0 references

Q2769588

0 references

Branching bisimulation congruence for probabilistic systems

0 references

Branching bisimulation for probabilistic systems: characteristics and decidability

0 references

Axiomatizing probabilistic processes: ACP with generative probabilities

0 references

Comparative branching-time semantics for Markov chains

0 references

Q4508289

0 references

Q4535031

0 references

Process algebra for synchronous communication

0 references

Q2746874

0 references

Non-bisimulation-based Markovian behavioral equivalences

0 references

Q5858729

0 references

Performance measure sensitive congruences for Markovian process algebras

0 references

Q4536610

0 references

Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

0 references

A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time

0 references

Q4813207

0 references

Discrete time generative-reactive probabilistic processes with different advancing speeds

0 references

A Theory of Communicating Sequential Processes

0 references

Q4484499

0 references

Algebraic theory of probabilistic and nondeterministic processes.

0 references

A testing scenario for probabilistic processes

0 references

Testing preorders for probabilistic processes.

0 references

Testing equivalence as a bisimulation equivalence

0 references

Absolute versus relative time in process algebras.

0 references

Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation

0 references

Q4255553

0 references

Q4791844

0 references

Game Refinement Relations and Metrics

0 references

Extensional equivalences for transition systems

0 references

Testing equivalences for processes

0 references

Rate-Based Transition Systems for Stochastic Process Calculi

0 references

A uniform definition of stochastic process calculi

0 references

Axiomatizations for probabilistic finite-state behaviors

0 references

Characterising Testing Preorders for Finite Probabilistic Processes

0 references

Testing Finitary Probabilistic Processes

0 references

Scalar Outcomes Suffice for Finitary Probabilistic Testing

0 references

Optimal state-space lumping in Markov chains

0 references

Finite state Markovian decision processes

0 references

Bisimulation for labelled Markov processes

0 references

Weak bisimulation is sound and complete for pCTL\(^*\)

0 references

Retaining the Probabilities in Probabilistic Testing Theory

0 references

Equivalence notions and model minimization in Markov decision processes

0 references

Acceptance trees

0 references

Exploring probabilistic bisimulations. I

0 references

Algebraic laws for nondeterminism and concurrency

0 references

Interactive Markov chains. And the quest for quantified quality

0 references

Probabilistic logical characterization

0 references

Q4032309

0 references

Probabilistic models for the guarded command language

0 references

Testing preorders for probabilistic processes can be characterized by simulations

0 references

CCS expressions, finite state processes, and three problems of equivalence

0 references

Formal verification of parallel programs

0 references

Continuous-time probabilistic automata

0 references

Q4223011

0 references

Automatic verification of real-time systems with discrete probability distributions.

0 references

Bisimulation through probabilistic testing

0 references

Probabilistic and prioritized models of timed CSP

0 references

CONCUR 2003 - Concurrency Theory

0 references

A complete inference system for a class of regular behaviours

0 references

A complete axiomatisation for observational congruence of finite-state behaviours

0 references

Q2847403

0 references

Q4018066

0 references

Refinement-oriented probability for CSP

0 references

Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes

0 references

Algebraic theory of probabilistic processes.

0 references

Three Partition Refinement Algorithms

0 references

Q3907077

0 references

Q4536612

0 references

A structural approach to operational semantics

0 references

Q4315289

0 references

Probabilistic automata

0 references

Testing probabilistic automata

0 references

Probabilistic communicating processes

0 references

Validation of Stochastic Systems

0 references

Bisimulations Meet PCTL Equivalences for Probabilistic Automata

0 references

Q4324960

0 references

Efficient Modelling and Generation of Markov Automata

0 references

Processes with probabilities, priority and time

0 references

Q4965819

0 references

A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata

0 references

Q2760238

0 references

Reactive, generative, and stratified models of probabilistic processes

0 references

Branching time and abstraction in bisimulation semantics

0 references

Identifiers

zbMATH Open document ID

1358.68210

0 references

DOI

10.1016/j.ic.2013.02.004

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:384933

@@ Property / describes a project that uses @@
+PEPA
@@ Property / describes a project that uses: PEPA / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2013.02.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2146187895
@@ Property / OpenAlex ID: W2146187895 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124439082
@@ Property / Wikidata QID: Q124439082 / rank @@
+Normal rank
@@ Property / cites work @@
+Observation equivalence as a testing equivalence
@@ Property / cites work: Observation equivalence as a testing equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+Equational Axioms for Probabilistic Bisimilarity
@@ Property / cites work: Equational Axioms for Probabilistic Bisimilarity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3394898
@@ Property / cites work: Q3394898 / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of timed automata
@@ Property / cites work: A theory of timed automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q2769588
@@ Property / cites work: Q2769588 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching bisimulation congruence for probabilistic systems
+Normal rank
@@ Property / cites work @@
+Branching bisimulation for probabilistic systems: characteristics and decidability
+Normal rank
@@ Property / cites work @@
+Axiomatizing probabilistic processes: ACP with generative probabilities
+Normal rank
@@ Property / cites work @@
+Deciding bisimilarity and similarity for probabilistic processes.
+Normal rank
@@ Property / cites work @@
+Comparative branching-time semantics for Markov chains
+Normal rank
@@ Property / cites work @@
+Q4508289
@@ Property / cites work: Q4508289 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535031
@@ Property / cites work: Q4535031 / rank @@
+Normal rank
@@ Property / cites work @@
+Process algebra for synchronous communication
@@ Property / cites work: Process algebra for synchronous communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q2746874
@@ Property / cites work: Q2746874 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-bisimulation-based Markovian behavioral equivalences
+Normal rank
@@ Property / cites work @@
+Q5858729
@@ Property / cites work: Q5858729 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance measure sensitive congruences for Markovian process algebras
+Normal rank
@@ Property / cites work @@
+Q4536610
@@ Property / cites work: Q4536610 / rank @@
+Normal rank
@@ Property / cites work @@
+Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
+Normal rank
@@ Property / cites work @@
+Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
+Normal rank
@@ Property / cites work @@
+A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
+Normal rank
@@ Property / cites work @@
+Q4813207
@@ Property / cites work: Q4813207 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete time generative-reactive probabilistic processes with different advancing speeds
+Normal rank
@@ Property / cites work @@
+A Theory of Communicating Sequential Processes
@@ Property / cites work: A Theory of Communicating Sequential Processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484499
@@ Property / cites work: Q4484499 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic theory of probabilistic and nondeterministic processes.
+Normal rank
@@ Property / cites work @@
+A testing scenario for probabilistic processes
@@ Property / cites work: A testing scenario for probabilistic processes / rank @@
+Normal rank
@@ Property / cites work @@
+Testing preorders for probabilistic processes.
@@ Property / cites work: Testing preorders for probabilistic processes. / rank @@
+Normal rank
@@ Property / cites work @@
+Testing equivalence as a bisimulation equivalence
@@ Property / cites work: Testing equivalence as a bisimulation equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+Absolute versus relative time in process algebras.
+Normal rank
@@ Property / cites work @@
+Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
+Normal rank
@@ Property / cites work @@
+Q4255553
@@ Property / cites work: Q4255553 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4791844
@@ Property / cites work: Q4791844 / rank @@
+Normal rank
@@ Property / cites work @@
+Game Refinement Relations and Metrics
@@ Property / cites work: Game Refinement Relations and Metrics / rank @@
+Normal rank
@@ Property / cites work @@
+Extensional equivalences for transition systems
@@ Property / cites work: Extensional equivalences for transition systems / rank @@
+Normal rank
@@ Property / cites work @@
+Testing equivalences for processes
@@ Property / cites work: Testing equivalences for processes / rank @@
+Normal rank
@@ Property / cites work @@
+Rate-Based Transition Systems for Stochastic Process Calculi
+Normal rank
@@ Property / cites work @@
+A uniform definition of stochastic process calculi
+Normal rank
@@ Property / cites work @@
+Axiomatizations for probabilistic finite-state behaviors
+Normal rank
@@ Property / cites work @@
+Characterising Testing Preorders for Finite Probabilistic Processes
+Normal rank
@@ Property / cites work @@
+Testing Finitary Probabilistic Processes
@@ Property / cites work: Testing Finitary Probabilistic Processes / rank @@
+Normal rank
@@ Property / cites work @@
+Scalar Outcomes Suffice for Finitary Probabilistic Testing
+Normal rank
@@ Property / cites work @@
+Optimal state-space lumping in Markov chains
@@ Property / cites work: Optimal state-space lumping in Markov chains / rank @@
+Normal rank
@@ Property / cites work @@
+Finite state Markovian decision processes
@@ Property / cites work: Finite state Markovian decision processes / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation for labelled Markov processes
@@ Property / cites work: Bisimulation for labelled Markov processes / rank @@
+Normal rank
@@ Property / cites work @@
+Weak bisimulation is sound and complete for pCTL\(^*\)
+Normal rank
@@ Property / cites work @@
+Retaining the Probabilities in Probabilistic Testing Theory
+Normal rank
@@ Property / cites work @@
+Equivalence notions and model minimization in Markov decision processes
+Normal rank
@@ Property / cites work @@
+Acceptance trees
@@ Property / cites work: Acceptance trees / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring probabilistic bisimulations. I
@@ Property / cites work: Exploring probabilistic bisimulations. I / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic laws for nondeterminism and concurrency
@@ Property / cites work: Algebraic laws for nondeterminism and concurrency / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive Markov chains. And the quest for quantified quality
+Normal rank
@@ Property / cites work @@
+Probabilistic logical characterization
@@ Property / cites work: Probabilistic logical characterization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4032309
@@ Property / cites work: Q4032309 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic models for the guarded command language
+Normal rank
@@ Property / cites work @@
+Testing preorders for probabilistic processes can be characterized by simulations
+Normal rank
@@ Property / cites work @@
+CCS expressions, finite state processes, and three problems of equivalence
+Normal rank
@@ Property / cites work @@
+Formal verification of parallel programs
@@ Property / cites work: Formal verification of parallel programs / rank @@
+Normal rank
@@ Property / cites work @@
+Continuous-time probabilistic automata
@@ Property / cites work: Continuous-time probabilistic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223011
@@ Property / cites work: Q4223011 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic verification of real-time systems with discrete probability distributions.
+Normal rank
@@ Property / cites work @@
+Bisimulation through probabilistic testing
@@ Property / cites work: Bisimulation through probabilistic testing / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic and prioritized models of timed CSP
@@ Property / cites work: Probabilistic and prioritized models of timed CSP / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2003 - Concurrency Theory
@@ Property / cites work: CONCUR 2003 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A complete inference system for a class of regular behaviours
+Normal rank
@@ Property / cites work @@
+A complete axiomatisation for observational congruence of finite-state behaviours
+Normal rank
@@ Property / cites work @@
+Q2847403
@@ Property / cites work: Q2847403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4018066
@@ Property / cites work: Q4018066 / rank @@
+Normal rank
@@ Property / cites work @@
+Refinement-oriented probability for CSP
@@ Property / cites work: Refinement-oriented probability for CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
+Normal rank
@@ Property / cites work @@
+Algebraic theory of probabilistic processes.
@@ Property / cites work: Algebraic theory of probabilistic processes. / rank @@
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907077
@@ Property / cites work: Q3907077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536612
@@ Property / cites work: Q4536612 / rank @@
+Normal rank
@@ Property / cites work @@
+A structural approach to operational semantics
@@ Property / cites work: A structural approach to operational semantics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4315289
@@ Property / cites work: Q4315289 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic automata
@@ Property / cites work: Probabilistic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Testing probabilistic automata
@@ Property / cites work: Testing probabilistic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic communicating processes
@@ Property / cites work: Probabilistic communicating processes / rank @@
+Normal rank
@@ Property / cites work @@
+Validation of Stochastic Systems
@@ Property / cites work: Validation of Stochastic Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulations Meet PCTL Equivalences for Probabilistic Automata
+Normal rank
@@ Property / cites work @@
+Q4324960
@@ Property / cites work: Q4324960 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Modelling and Generation of Markov Automata
+Normal rank
@@ Property / cites work @@
+Processes with probabilities, priority and time
@@ Property / cites work: Processes with probabilities, priority and time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4965819
@@ Property / cites work: Q4965819 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
+Normal rank
@@ Property / cites work @@
+Q2760238
@@ Property / cites work: Q2760238 / rank @@
+Normal rank
@@ Property / cites work @@
+Reactive, generative, and stratified models of probabilistic processes
+Normal rank
@@ Property / cites work @@
+Branching time and abstraction in bisimulation semantics
+Normal rank