Results 1  10
of
50,231
Causal Time Calculus
 In Proc. FORMATS’03, LNCS
, 2002
"... Abstract. We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two consistent semantics: a structural operational semantics (as usual for process algebras) and a denotational semant ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
semantics in terms of Petri nets in which time is introduced through counters of explicit clock ticks. This way of modelling time has been called causal time so the process algebra is itself called the Causal Time Calculus (CTC). It was shown in a separate paper [3] that the causal time approach allowed
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Featherweight Java: A Minimal Core Calculus for Java and GJ
 ACM Transactions on Programming Languages and Systems
, 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract

Cited by 659 (23 self)
 Add to MetaCart
of the full language (including interfaces and even assignment) to obtain a small calculus, Featherweight Java, for which rigorous proofs are not only possible but easy. Featherweight Java bears a similar relation to Java as the lambdacalculus does to languages such as ML and Haskell. It offers a similar
A Time Calculus for Natural Language
 In The 4th Workshop on Inference in Computational Semantics
, 2003
"... Automatic extraction and reasoning of temporal properties in a natural language discourse has not seen wide use in practical systems due to its demand of a rich and compositional, yet inferencefriendly representation of time. We address the problem by proposing a time calculus within the framework ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Automatic extraction and reasoning of temporal properties in a natural language discourse has not seen wide use in practical systems due to its demand of a rich and compositional, yet inferencefriendly representation of time. We address the problem by proposing a time calculus within the framework
RealTime Calculus For Scheduling Hard RealTime Systems
 in ISCAS
, 2000
"... This paper establishes a link between three areas, namely MaxPlus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and realtime scheduling. In particular, it is shown that important res ..."
Abstract

Cited by 145 (24 self)
 Add to MetaCart
This paper establishes a link between three areas, namely MaxPlus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and realtime scheduling. In particular, it is shown that important
Multiprocessor Extensions to RealTime Calculus
"... Many embedded platforms consist of a heterogeneous collection of processing elements, memory modules, and communication subsystems. These components often implement different scheduling/arbitration policies, have different interfaces, and are supplied by different vendors. Hence, compositional techn ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
and analysis techniques have been proposed that directly target multiprocessors. In this paper, we present a compositional analysis framework that is obtained by extending the realtime calculus framework to incorporate multiprocessors in which tasks are scheduled using wellknown multiprocessor scheduling
A timed calculus for wireless systems
 TCS
"... We propose a timed broadcasting process calculus for wireless systems where timeconsuming communications are exposed to collisions. The operational semantics of our calculus is given in terms of a labelled transition system. The calculus enjoys a number of desirable time properties such as (i) tim ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We propose a timed broadcasting process calculus for wireless systems where timeconsuming communications are exposed to collisions. The operational semantics of our calculus is given in terms of a labelled transition system. The calculus enjoys a number of desirable time properties such as (i
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5411 (68 self)
 Add to MetaCart
long time, ‘variational ’ problems have been identified mostly with the ‘calculus of variations’. In that venerable subject, built around the minimization of integral functionals, constraints were relatively simple and much of the focus was on infinitedimensional function spaces. A major theme
Results 1  10
of
50,231