Results 1  10
of
81
A class of automata for the verification of infinite, resourceallocating behaviours
, 2014
"... Process calculi for serviceoriented computing often feature generation of fresh resources. Socalled nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal automata t ..."
Abstract
 Add to MetaCart
representations of the (otherwise infinitestate) defined class of automata. The definition of such operations enables model checking of process calculi featuring infinite behaviours, and resource allocation, to be implemented using classical automatatheoretic methods.
Herbrand automata for hardware verification
 9th International Conference on Concurrency Theory CONCUR '98
, 1998
"... Abstract. The paper presents the new computational model of Herbrand engines which combines finitestate control with uninterpreted data and function registers, thus yielding a finite representation of infinitestate machines. Herbrand engines are used to provide a highlevel model of outoforder e ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The paper presents the new computational model of Herbrand engines which combines finitestate control with uninterpreted data and function registers, thus yielding a finite representation of infinitestate machines. Herbrand engines are used to provide a highlevel model of out
Flat Parametric Counter Automata
 In Automata, Languages and Programming, 33 rd International Colloquium, ICALP 2006
, 2006
"... Abstract. In this paper we study the reachability problem for parametric flatcounter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between nonparametric flat counter automata and Presburger arithmetic has been established previously ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
Introduction Flat counter automata [5, 6, 3, 4] have been extensively studied, as an important classof infinitestate systems, for which the reachability problem is decidable. The results obtained so far have been used in a number of successful verification tools, like FAST[2], LASH [18] or TREX [1]. Comon
Determinizing DiscountedSum Automata ∗
"... A discountedsum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the ith position of the run is divided by λ i, where the discount factor λ is a fixed rational number greater th ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial
Rewarding Probabilistic Hybrid Automata
"... ABSTRACT The joint consideration of randomness and continuous time is important for the formal verification of many real systems. Considering both facets is especially important for wireless sensor networks, distributed control applications, and many other systems of growing importance. Apart from ..."
Abstract
 Add to MetaCart
to decide such reward properties effectively for a generic class of models which have a discretecontinuous behaviour and involve both probabilistic as well as nondeterministic decisions. Experimental evidence is provided demonstrating the applicability of our approach.
The Impressive Power of Stopwatches
 IN PROC. OF CONCUR 2000: CONCURRENCY THEORY
, 2000
"... In this paper we define and study the class of stopwatch automata which are timed automata augmented with stopwatches and unobservable behaviour. In particular, we investigate the expressive power of this class of automata, and show as a main result that any finite or infinite timed language accept ..."
Abstract

Cited by 66 (11 self)
 Add to MetaCart
In this paper we define and study the class of stopwatch automata which are timed automata augmented with stopwatches and unobservable behaviour. In particular, we investigate the expressive power of this class of automata, and show as a main result that any finite or infinite timed language
Properties as Processes: their Specification and Verification
"... This paper presents a novel application of an untimed process algebra formalism to a class of timingcritical verification problems usually modelled with either timed automata or timed process algebra. We show that a formalism based on interacting automata can model system components, behavioural ..."
Abstract
 Add to MetaCart
This paper presents a novel application of an untimed process algebra formalism to a class of timingcritical verification problems usually modelled with either timed automata or timed process algebra. We show that a formalism based on interacting automata can model system components, behavioural
Verification of recursive parallel systems ∗.
, 2003
"... In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowi ..."
Abstract
 Add to MetaCart
, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a class of properties about infinite derivations (infinite term rewritings). The given results can be exploited for the automatic verification of some classes of linear time properties of infinite state systems
Checking Timed Automata for Some Discretisable Duration Properties
 Published in Journal of Computer Science and Technology, Volume 15, Number 5
, 1998
"... In this paper we propose a technique for checking a timed automaton w.r.t a class of discretisable duration properties. It is shown in the paper that if only integral constants are allowed in the time constraints of the timed automata, a linear duration property or an interstate duration property i ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
In this paper we propose a technique for checking a timed automaton w.r.t a class of discretisable duration properties. It is shown in the paper that if only integral constants are allowed in the time constraints of the timed automata, a linear duration property or an interstate duration property
Verification of Description Logic Knowledge and Action Bases
, 2012
"... doi:10.3233/9781614990987103 ..."
Results 1  10
of
81