Results 1  10
of
164
When are timed automata weakly timed bisimilar to time Petri nets?
 25TH CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2005), HYDERABAD, INDIA LNCS
, 2005
"... In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass T A wtb of TA equivalent to some TPN for t ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass T A wtb of TA equivalent to some TPN
Comparison of the expressiveness w.r.t. timed bisimilarity of kbounded Arc, Place and Transition Time Petri Nets with weak and strong single server semantics
"... In this paper, we consider bounded Time Petri Nets where time intervals (strict and large) are associated with places (PTPN), arcs (ATPN) or transitions (TTPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are: (i) with strong semantics, ATPN is strictly more expressive than PTPN and TTPN; (ii) with strong semantics PTPN and TTPN are incomparable; (iii) TTPN with strong semantics and TTPN with weak
Bisimilar Linear Systems
, 2001
"... The notion of bisimulation in theoretical computer science is one of the main complexity reduction methods for the analysis and synthesis of labeled transition systems. Bisimulations are special quotients of the state space that preserve many important properties expressible in temporal logics, and, ..."
Abstract

Cited by 68 (14 self)
 Add to MetaCart
, in particular, reachability. In this paper, the framework of bisimilar transition systems is applied to various transition systems that are generated by linear control systems. Given a discretetime or continuoustime linear system, and a finite observation map, we characterize linear quotient maps that result
Is timed branching bisimilarity an equivalence indeed
 In Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005
, 2005
"... Abstract. We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching
Decidability of Strong Bisimilarity for Timed BPP
, 2002
"... We investigate a timed extension of the class of Basic Parallel Processes (BPP), in which actions are durational and urgent and parallel components have independent local clocks. The main result is decidability of strong bisimilarity, known also as performance equivalence, in this class. This ext ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We investigate a timed extension of the class of Basic Parallel Processes (BPP), in which actions are durational and urgent and parallel components have independent local clocks. The main result is decidability of strong bisimilarity, known also as performance equivalence, in this class
Deciding Bisimilarity and Similarity for Probabilistic Processes
, 2000
"... This paper deals with probabilistic and nondeterministic processes represented by a variant of labelled transition systems where any outgoing transition of a state s is augmented with probabilities for the possible successor states. Our main contribution are algorithms for computing the bisimulatio ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
the bisimulation equivalence classes as introduced by Larsen & Skou [44] and the simulation preorder `a la Segala & Lynch [57]. The algorithm for deciding bisimilarity is based on a variant of the traditional partitioning technique [43, 51] and runs in time O(mn(log m+ log n)) where m is the number
Complexity of deciding bisimilarity of nBPP and bisimilarity of BPP with finitestate system
"... Abstract. Jančar has recently shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space (presented at LiCS 2003). In this paper are summarized two results which use general techniques from Jančar’s paper. First result by Kot and Jančar (presented at AVIS 2004) show ..."
Abstract
 Add to MetaCart
) shows that bisimilarity on normed basic parallel processes can be decided in O(n 3). The second result by Kot and Sawa (submitted to Infinity 2004) shows that bisimilarity of given BPP and finitestate system can be decided in polynomial time, concretely in O(n 5).
Bisimilarity Problems Requiring Exponential Time (Extended Abstract)
, 1996
"... We study the complexity of deciding bisimilarity between nondeterministic processes. In particular, we consider a calculus with recursive definitions of processes, value passing (i.e. input/output of data) and an equality test over data. We show that the bisimilarity problem is EXPcomplete over ..."
Abstract
 Add to MetaCart
complete over this calculus and thus that exponential time is provably necessary in order to solve it. We then prove that, if we add a parallel composition operator to the calculus, and we impose that parallel composition is never used inside recursive definitions, then the bisimilarity problem is still EXP
Approximately bisimilar finite abstractions of stable linear systems
 in Hybrid Systems: Computation and Control, ser. Lecture
, 2007
"... The use of bisimilar finite abstractions of continuous and hybrid systems, greatly simplifies complex computational tasks such as verification or control synthesis. Unfortunately, because of the strong requirements of bisimulation relations, such abstractions exist only for quite restrictive class ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
and hybrid systems. In this paper, we show that for the class of stable discretetime linear systems with constrained inputs, there exists an approximately bisimilar finite state system of any desired precision. We describe an effective procedure for the construction of this abstraction, based
OntheFly Exact Computation of Bisimilarity Distances
 In TACAS, volume 7795 of Lecture Notes in Computer Science
"... Abstract. This paper proposes an algorithm for exact computation of bisimilarity distances between discretetime Markov chains introduced by Desharnais et. al. Our work is inspired by the theoretical results presented by Chen et. al. at FoSSaCS’12, proving that these distances can be computed in po ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract. This paper proposes an algorithm for exact computation of bisimilarity distances between discretetime Markov chains introduced by Desharnais et. al. Our work is inspired by the theoretical results presented by Chen et. al. at FoSSaCS’12, proving that these distances can be computed
Results 1  10
of
164