Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hasuo, Ichiro
Jacobs, Bart
and
Sokolova, Ana
2006.
Generic Trace Theory.
Electronic Notes in Theoretical Computer Science,
Vol. 164,
Issue. 1,
p.
47.
Segala, Roberto
2006.
CONCUR 2006 – Concurrency Theory.
Vol. 4137,
Issue. ,
p.
64.
Hasuo, Ichiro
and
Kawabe, Yoshinobu
2007.
Programming Languages and Systems.
Vol. 4421,
Issue. ,
p.
379.
Beaulieu, Guy
2007.
Probabilistic Completion of Nondeterministic Models.
Electronic Notes in Theoretical Computer Science,
Vol. 173,
Issue. ,
p.
67.
Deng, Yuxin
van Glabbeek, Rob
Hennessy, Matthew
Morgan, Carroll
and
Zhang, Chenyi
2007.
Remarks on Testing Probabilistic Processes.
Electronic Notes in Theoretical Computer Science,
Vol. 172,
Issue. ,
p.
359.
Goubault-Larrecq, Jean
2007.
Computer Science Logic.
Vol. 4646,
Issue. ,
p.
542.
de Frutos Escrig, David
Palomino, Miguel
and
Fábregas, Ignacio
2008.
Formal Techniques for Networked and Distributed Systems – FORTE 2008.
Vol. 5048,
Issue. ,
p.
283.
Jacobs, Bart
2008.
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems.
Electronic Notes in Theoretical Computer Science,
Vol. 203,
Issue. 5,
p.
131.
Li, Xifu
Zheng, Guang
Li, Lian
Wu, Jinzhao
and
Chen, Wenbo
2009.
Stochastic Extension for Real Time Process Algebra with Urgency Executing Policy.
p.
1.
Escardó, Martín
2009.
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting.
Electronic Notes in Theoretical Computer Science,
Vol. 249,
Issue. ,
p.
219.
Rabehaja, T.M.
and
Sanders, J.W.
2009.
Data Refinement with Probability in Mind.
Electronic Notes in Theoretical Computer Science,
Vol. 259,
Issue. ,
p.
165.
Rabehaja, T.M.
and
Sanders, J.W.
2009.
Refinement Algebra with Explicit Probabilism.
p.
63.
Brown, Daniel
and
Pucella, Riccardo
2009.
Categories of Timed Stochastic Relations.
Electronic Notes in Theoretical Computer Science,
Vol. 249,
Issue. ,
p.
193.
Chen, Yifeng
and
Sanders, J. W.
2009.
FM 2009: Formal Methods.
Vol. 5850,
Issue. ,
p.
467.
Zheng, Guang
Li, Xifu
Li, Lian
and
Wu, Jinzhao
2009.
Process Algebra for Web Servers with Timed-Priority Executing Policy.
p.
1.
Zheng, Guang
Jiang, Miao
Chen, Gao
Zha, Qinglin
and
Lu, Aiping
2010.
Process Algebra with Goal Based Bisimulation.
p.
89.
Hasuo, Ichiro
Kawabe, Yoshinobu
and
Sakurada, Hideki
2010.
Probabilistic anonymity via coalgebraic simulations.
Theoretical Computer Science,
Vol. 411,
Issue. 22-24,
p.
2239.
Cabrera, I.P.
Cordero, P.
Gutiérrez, G.
Martínez, J.
and
Ojeda-Aciego, M.
2010.
A coalgebraic approach to non-determinism: Applications to multilattices.
Information Sciences,
Vol. 180,
Issue. 22,
p.
4323.
Zheng, Guang
He, Xiaojuan
Jiang, Miao
and
Lu, Aiping
2010.
Goal based bisimulation for testing therapies in traditional Chinese medicine.
p.
603.
Goncharov, Sergey
and
Schroder, Lutz
2011.
Powermonads and Tensors of Unranked Effects.
p.
227.