Results 11  20
of
874,891
Behavioural Equivalences on FiniteState Systems are PTIMEhard
, 2005
"... The paper shows a logspacereduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptimehard, even for finite acyclic labelled transition systems. This reproves and substantially ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The paper shows a logspacereduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e., language inclusion) is ptimehard, even for finite acyclic labelled transition systems. This reproves and substantially
On Weak Equivalence of Linear Systems and Finite State Systems
"... ABSTRACT It is shown that finite state machines exist which are weakly equivalent to linear systems for some nontrivial definitions of weak equivalence. Two systems, one linear with state space R", the other with finite state spece, operate on the same stationary uncorrelated input sequence u. ..."
Abstract
 Add to MetaCart
ABSTRACT It is shown that finite state machines exist which are weakly equivalent to linear systems for some nontrivial definitions of weak equivalence. Two systems, one linear with state space R", the other with finite state spece, operate on the same stationary uncorrelated input sequence u
A Comparison of Succinctly Represented Finitestate Systems
"... We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study ..."
Abstract
 Add to MetaCart
We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover
On Computing Optimal Controllers for Finite State Systems
 PROC. OF 36TH IEEE CDC
, 1997
"... From a computational point of view many control problems involve synthesis of controllers for Finite State Systems (FSSs). In this paper we address the problem of automatic synthesis of Optimal Controllers (OCs) for FSSs. Such problem has been widely studied and many algorithms are known for it. How ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
From a computational point of view many control problems involve synthesis of controllers for Finite State Systems (FSSs). In this paper we address the problem of automatic synthesis of Optimal Controllers (OCs) for FSSs. Such problem has been widely studied and many algorithms are known for it
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).
Specifying RealTime FiniteState Systems in Linear Logic
 In 2nd International Workshop on Constraint Programming for TimeCritical Applications and MultiAgent Systems (COTIC
, 1998
"... Realtime finitestate systems may be specified in linear logic by means of linear implications between conjunctions of fixed finite length. In this setting, where time is treated as a dense linear ordering, safety properties may be expressed as certain provability problems. These provability proble ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
Realtime finitestate systems may be specified in linear logic by means of linear implications between conjunctions of fixed finite length. In this setting, where time is treated as a dense linear ordering, safety properties may be expressed as certain provability problems. These provability
Weak Bisimilarity between FiniteState Systems and BPA or Normed BPP is Decidable in Polynomial Time
 Theoretical Computer Science
, 2000
"... We prove that weak bisimilarity is decidable in polynomial time between finitestate systems and several classes of infinitestate systems: contextfree processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that weak bisimilarity is decidable in polynomial time between finitestate systems and several classes of infinitestate systems: contextfree processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak
Languagemeasuretheoretic optimal control of probabilistic finitestate systems
 Int. J. Contr
, 2007
"... Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a nonprobabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noisecorrupted observations, implying that any practical finitestate ap ..."
Abstract

Cited by 18 (15 self)
 Add to MetaCart
Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a nonprobabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noisecorrupted observations, implying that any practical finitestate
A semanticsbased verification tool for finitestate systems
 IN PROC. OF PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION, IX
, 1990
"... The Concurrency Workbench is an automated tool that caters for the analysis of concurrent finitestate processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its scope: a variety of different verification methods, including equivalence checking, preorder checking ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
The Concurrency Workbench is an automated tool that caters for the analysis of concurrent finitestate processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its scope: a variety of different verification methods, including equivalence checking, preorder
Results 11  20
of
874,891