Results 1  10
of
1,857
Model Checking of Probabilistic and Nondeterministic Systems
, 1995
"... . The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. ..."
Abstract

Cited by 291 (13 self)
 Add to MetaCart
. The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance
SPEED: A Stateless Protocol for RealTime Communication In Sensor Networks
, 2003
"... In this paper, we present a realtime communication protocol for sensor networks, called SPEED. The protocol provides three types of realtime communication services, namely, realtime unicast, realtime areamulticast and realtime areaanycast. SPEED is specifically tailored to be a stateless, loc ..."
Abstract

Cited by 338 (32 self)
 Add to MetaCart
In this paper, we present a realtime communication protocol for sensor networks, called SPEED. The protocol provides three types of realtime communication services, namely, realtime unicast, realtime areamulticast and realtime areaanycast. SPEED is specifically tailored to be a stateless
Automated Consistency Checking of Requirements Specifications
, 1996
"... This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed i ..."
Abstract

Cited by 270 (33 self)
 Add to MetaCart
This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed
The Nondeterministic Complexity of a Finite Automaton
, 1990
"... We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable Msubsets of a free monoid into a ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable Msubsets of a free monoid
From nondeterministic Büchi and Streett automata to deterministic parity automata
 In 21st Symposium on Logic in Computer Science (LICS’06
, 2006
"... Determinization and complementation are fundamental notions in computer science. When considering finite automata on finite words determinization gives also a solution to complementation. Given a nondeterministic finite automaton there exists an exponential construction that gives a deterministic au ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
, we reconsider Safra’s determinization constructions. We show how to construct automata with fewer states and, most importantly, parity acceptance condition. Specifically, starting from a nondeterministic Büchi automaton with n states our construction yields a deterministic parity automaton with n 2n
Nondeterministic controllers of nondeterministic processes
 Logic and Automata, volume 2 of Texts in Logic and Games
, 2007
"... The controller synthesis problem as formalized by Ramadge and Wonham consists of finding a finite controller that when synchronized with a given plant results in a system satisfying a required property. In this setting, both a plant and a controller are deterministic finite automata, while synchron ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
of the whole system. In this paper, an extension of the setting to nondeterministic processes is studied. In other words, the case when both a system and a controller can be presented by a nondeterministic automaton. This extension is motivated by examples in control where a continuous quantity is measured
From nondeterministic suffix automaton to lazy suffix tree
"... Given two strings, a pattern P of length m and a text T of length n over some alphabet Σ of size σ, we consider the exact string matching problem, i.e. we want to report all occurrences of P in T. The wellknown BackwardNondeterministicDAWGMatching (BNDM) algorithm is one of the most efficient ..."
Abstract
 Add to MetaCart
algorithm for short to moderate length patterns. In this paper – as a prelude – we take the underlying nondeterministic suffix automaton and apply it to the text instead of to the pattern. The resulting algorithm is surprisingly simple, and efficient for relatively short patterns and small alphabet sizes
On the Verification of Nondeterministic Automata Specifications of Probabilistic RealTime Systems
, 1999
"... In [2], Alur et al. presented an algorithm for the problem of verifying deterministic timed automata specifications of probabilistic realtime systems given as generalized semiMarkov processes; and posed the question of the verification of nondeterministic specifications. We give a partial answer t ..."
Abstract
 Add to MetaCart
In [2], Alur et al. presented an algorithm for the problem of verifying deterministic timed automata specifications of probabilistic realtime systems given as generalized semiMarkov processes; and posed the question of the verification of nondeterministic specifications. We give a partial answer
Quotientbased Control Synthesis for NonDeterministic Plants with MuCalculus Specifications
 In 45th IEEE Conference on Decision and Control
, 2006
"... Abstract — We study the control of a nondeterministic discrete event system (DES) subject to a control specification expressed in the propositional mucalculus, under complete observation of events. Given a plant automaton model and a mucalculus specification we provide a set of rules that computes ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract — We study the control of a nondeterministic discrete event system (DES) subject to a control specification expressed in the propositional mucalculus, under complete observation of events. Given a plant automaton model and a mucalculus specification we provide a set of rules
Quotientbased Approach to Control of Nondeterministic DiscreteEvent Systems with Calculus Specification
"... Abstract — We study the control of a nondeterministic discrete event system (DES) subject to a control specification expressed in propositional calculus under complete observation of events. Solution is obtained through “quotienting”: Given a plant automaton model and a calculus specification we p ..."
Abstract
 Add to MetaCart
Abstract — We study the control of a nondeterministic discrete event system (DES) subject to a control specification expressed in propositional calculus under complete observation of events. Solution is obtained through “quotienting”: Given a plant automaton model and a calculus specification we
Results 1  10
of
1,857