Sciweavers

ARTS
1997
Springer
13 years 8 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks
ARTS
1997
Springer
13 years 8 months ago
Regular Processes and Timed Automata
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
Pedro R. D'Argenio
ARTS
1997
Springer
13 years 8 months ago
Refinement of Time
We introduce a mathematical model of the timed behaviour of components with streams as input and output using a hierarchy of timing concepts. We distinguish non-timed streams, dis...
Manfred Broy
ARTS
1999
Springer
13 years 8 months ago
Verifying Progress in Timed Systems
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...
Stavros Tripakis
ARTS
1999
Springer
13 years 8 months ago
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
Annabelle McIver
ARTS
1999
Springer
13 years 8 months ago
A Formal Model of Real-Time Program Compilation
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
Karl Lermer, Colin J. Fidge
ARTS
1999
Springer
13 years 8 months ago
Proof Assistance for Real-Time Systems Using an Interactive Theorem Prover
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
Paul Z. Kolano
ARTS
1999
Springer
13 years 8 months ago
ProbVerus: Probabilistic Symbolic Model Checking
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...