scientific article; zbMATH DE number 7333244

MaRDI QIDQ5858729zbMATH OpenFDO

Authors Marco Bernardo

Publication date 14 April 2021

Full work available at URL https://arxiv.org/abs/1207.0874, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2012.9

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Theoretical Aspects of Computing – ICTAC 2005
• Publication:4941915
• A note on the characterization of weak bisimulation congruence in CCS
• Weak bisimulation as a congruence in MSOS
• Hybrid Systems: Computation and Control
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Weak bisimulation for probabilistic timed automata
• Congruent weak bisimulation with dense real-time

Cited in

(5)

• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Proportional lumpability and proportional bisimilarity
• Theoretical Aspects of Computing – ICTAC 2005
• Behavioural equivalences for coalgebras with unobservable moves

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 Q5858729)