A Process Algebra for Real-Time Programs

Authors:
Henning Dierks
Affiliations:
-
Venue:
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Year:
2000

Citing 11
Cited 0

Compiling Real-Time Specifications into Extended Automata

IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
A theory of timed automata

Theoretical Computer Science
Symbolic model checking for real-time systems

Information and Computation
A brief history of Timed CSP

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
An operational semantics for timed CSP

Information and Computation
Timing analysis of asynchronous circuits using timed automata

CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Operational and Logical Semantics for Polling Real-Time Systems

FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
MOBY/PLC - Graphical Development of PLC-Automata

FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
PLC-Automata: A New Class of Implementable Real-Time Automata

ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Hardware timing verification using KRONOS

ICCSSE '96 Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering
Synthesizing controllers from real-time specifications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce a generalised notion of a real-time specification language ("GPLC-Automata") that can be translated directly into real-time programs. In order to describe the behaviour of several GPLC-Automata implemented on one machine we introduce composition operators which form a process algebra. We give several algebraic laws and prove that each system is equivalent to a system in a certain normal form. Moreover, we demonstrate how a real-time specification in terms of GPLC-Automata can be decomposed into an untimed part and a timed part.