activity
20112024
most citedBisimulations Meet PCTL Equivalences for Probabilistic Automata

20 citations · 53 across the 9 of their papers we have counts for

collaborators

9 papers

cs.CL2024★ 1 cited

Protecting Your LLMs with Information Bottleneck

Zichuan Liu, Zefan Wang, Linjie Xu +6

The advent of large language models (LLMs) has revolutionized the field of natural language processing, yet they might be attacked to produce harmful content. Despite efforts to et…

cs.LO2016

Verify LTL with Fairness Assumptions Efficiently

Yong Li, Lei Song, Yuan Feng +1

This paper deals with model checking problems with respect to LTL properties under fairness assumptions. We first present an efficient algorithm to deal with a fragment of fairness…

cs.FL2015★ 4 cited

Distribution-based Bisimulation and Bisimulation Metric in Probabilistic Automata

Yuan Feng, Lei Song, Lijun Zhang

Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the ot…

cs.LO2015★ 6 cited

A Simple Probabilistic Extension of Modal Mu-calculus

Wanwei Liu, Lei Song, Ji Wang +1

Probabilistic systems are an important theme in AI domain. As the specification language, the logic PCTL is now the default logic for reasoning about probabilistic properties. In t…

cs.LO2014★ 2 cited

Probably Safe or Live

Joost-Pieter Katoen, Lei Song, Lijun Zhang

This paper presents a formal characterisation of safety and liveness properties à la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is estab…

cs.LO2012

Bisimulations and Logical Characterizations on Continuous-time Markov Decision Processes

Lei Song, Lijun Zhang, Jens Chr. Godskesen

In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with re…

cs.FL2012★ 19 cited

Late Weak Bisimulation for Markov Automata

Christian Eisentraut, Jens Chr. Godskesen, Holger Hermanns +2

Weak bisimilarity is a distribution-based equivalence notion for Markov automata. It has gained some popularity as the coarsest reasonable behavioural equivalence on Markov automat…

cs.PF2011★ 1 cited

A Stochastic Broadcast Pi-Calculus

Lei Song, Flemming Nielson, Bo Friis Nielsen

In this paper we propose a stochastic broadcast PI-calculus which can be used to model server-client based systems where synchronization is always governed by only one participant.…

cs.LO2011★ 20 cited

Bisimulations Meet PCTL Equivalences for Probabilistic Automata

Lei Song, Lijun Zhang, Jens Chr. Godskesen +1

Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, wher…