Results 1  10
of
125
The Complexity of BisimilarityChecking for OneCounter Processes
, 2003
"... We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finitestat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finite
Towards Automatic Bisimilarity Checking in the Spi Calculus
, 1999
"... The spi calculus by Abadi and Gordon, an extension of Robin Milner's πcalculus, is designed to model cryptographic protocols. Classic security properties are easily expressed in spi using the notion of testing equivalence by De Nicola and Hennessy. However, proving processes testing equivalent ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
equivalent is a daunting task. Thus framed bisimilarity, a bisimulation method implying testing equivalence, has been proposed by Abadi and Gordon. Unfortunately this method is immediately not suited for automation, as the definition of framed bisimilarity uses several levels of quantification over infinite
Towards Automatic Bisimilarity Checking in the Spi Calculus
"... Abstract. The spi calculus by Abadi and Gordon, an extension of Robin Milner's πcalculus, is designed to model cryptographic protocols. Classic security properties are easily expressed in spi using the notion of testing equivalence by De Nicola and Hennessy. However, proving processes testing ..."
Abstract
 Add to MetaCart
testing equivalent is a daunting task. Thus framed bisimilarity, a bisimulation method implying testing equivalence, has been proposed by Abadi and Gordon. Unfortunately the definition of framed bisimilarity uses several levels of quantification over infinite domains and is therefore not effective
A Faster Parallel Implementation of the KanellakisSmolka Algorithm for Bisimilarity Checking
 In Proceedings of the International Computer Symposium
, 1998
"... Bisimulation equivalence is one of the most important equivalence relations that capture the notion of `behavioral equivalence' of concurrent systems. In this paper we present a randomized parallel implementation of the KanellakisSmolka algorithm that tests the bisimilarity of two finite CC ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Bisimulation equivalence is one of the most important equivalence relations that capture the notion of `behavioral equivalence' of concurrent systems. In this paper we present a randomized parallel implementation of the KanellakisSmolka algorithm that tests the bisimilarity of two finite
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 685 (12 self)
 Add to MetaCart
on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various modelchecking techniques that were originally developed for finite
The Algorithmics of Bisimilarity
"... 0.2 Classic algorithms for bisimilarity over finite labelled transition systems............................................................. 6 0.3 The complexity of checking bisimilarity over finite processes......... 25 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
0.2 Classic algorithms for bisimilarity over finite labelled transition systems............................................................. 6 0.3 The complexity of checking bisimilarity over finite processes......... 25
Completeness Results for Undecidable Bisimilarity Problems
 INFINITY 2003 PRELIMINARY VERSION
, 2003
"... We establish Σ1 1completeness (in the analytical hierarchy) of weak bisimilarity checking for infinitestate processes generated by pushdown automata and paralcompleteness of weak bisimilarity lel pushdown automata. The results imply Σ1 1 for Petri nets and give a negative answer to the open prob ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We establish Σ1 1completeness (in the analytical hierarchy) of weak bisimilarity checking for infinitestate processes generated by pushdown automata and paralcompleteness of weak bisimilarity lel pushdown automata. The results imply Σ1 1 for Petri nets and give a negative answer to the open
Hereditary history preserving bisimilarity is undecidable
 STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, volume 1770 of Lecture Notes in Computer Science
, 2000
"... Abstract History preserving bisimilarity (hpbisimilarity) and hereditary history preserving bisimilarity (hhpbisimilarity) are behavioural equivalences taking into account causal relationships between events of concurrent systems. Their prominent feature is being preserved under action refinement, ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
, an operation important for the topdown design of concurrent systems. We show thatunlike hpbisimilaritychecking hhpbisimilarity for finite labelled asynchronous transition systems is not decidable, by a reduction from the halting problem of 2counter machines. To make the proof more transparent we
A Local Algorithm for Checking Probabilistic Bisimilarity
"... Abstract—Bisimilarity is one of the most important relations for comparing the behaviour of formal systems in concurrency theory. Decision algorithms for bisimilarity in finite state systems are usually classified into two kinds: global algorithms are generally efficient but require to generate the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
concurrency theory, the study of local algorithms in probabilistic concurrency theory is not mature. In this paper we propose a polynomial time local algorithm for checking probabilistic bisimilarity. With mild modification, the algorithm can be easily adapted to decide probabilistic similarity with the same
Results 1  10
of
125