[HTML][HTML] A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

M Bernardo, R De Nicola, M Loreti - Information and Computation, 2013 - Elsevier
Labeled transition systems are typically used as behavioral models of concurrent processes.
Their labeled transitions define a one-step state-to-state reachability relation. This model …

A survey of Markovian behavioral equivalences

M Bernardo - International School on Formal Methods for the Design …, 2007 - Springer
Markovian behavioral equivalences are a means to relate and manipulate the formal
descriptions of systems with an underlying CTMC semantics. There are three fundamental …

Non-bisimulation-based Markovian behavioral equivalences

M Bernardo - The Journal of Logic and Algebraic Programming, 2007 - Elsevier
The behavioral equivalence that is typically used to relate Markovian process terms and to
reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is that …

Weighted lumpability on Markov chains

A Sharma, JP Katoen - … of Systems Informatics: 8th International Andrei …, 2012 - Springer
This paper reconsiders Bernardo's T-lumpability on continuous-time Markov chains
(CTMCs). This notion allows for a more aggressive state-level aggregation than ordinary …

A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

M Bernardo, S Botta - Mathematical Structures in Computer Science, 2008 - cambridge.org
Behavioural equivalences are a means of establishing whether computing systems possess
the same properties. The specific set of properties that are preserved by a specific …

Decision algorithms for probabilistic simulations

L Zhang - 2009 - publikationen.sulb.uni-saarland.de
In einem breiten Spektrum von Systemen, etwa bei eingebetteten, verteilten,
netzwerkbasierten und biologischen System sowie im Bereich Security, treten Phänomene …

A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems

S Das, A Sharma - Proceedings of the 39th ACM/SIGAPP Symposium on …, 2024 - dl.acm.org
This paper proposes a formal framework for minimizing, analyzing and verifying stochastic
process algebraic models using tools and techniques developed for the state-labeled …

[PDF][PDF] Silent steps in transition systems and Markov chains

N Trcka - 2007 - research.tue.nl
Silent steps in transition systems and Markov chains Page 1 Silent steps in transition systems
and Markov chains Citation for published version (APA): Trcka, N. (2007). Silent steps in …

Principles of Markov automata

CG Eisentraut - 2017 - publikationen.sulb.uni-saarland.de
A substantial amount of today's engineering problems revolve around systems that are
concurrent and stochastic by their nature. Solution approaches attacking these problems …

State space minimization preserving embeddings for continuous-time Markov chains

S Das, A Sharma - … Engineering and Stochastic Modeling: 17th European …, 2021 - Springer
This paper defines embeddings which allow one to construct an action labeled continuous-
time Markov chain (ACTMC) from a state labeled continuous-time Markov chain (SCTMC) …