The Algebra of Timed Processes, ATP
X. Nicollin,J. Sifakis +1 more
Reads0
Chats0
TLDR
It is shown that several d-unit delay constructs such as timeouts and watchdogs can be expressed in terms of the unit-delay operator and standard process algebra operators.Abstract:
The algebra of timed processes, ATP, uses a notion of discrete global time and suggests a conceptual framework for introducing time by extending untimed languages. The action vocabularly of ATP contains a special element representing the progress of time. The algebra has, apart from standard operators of process algebras such as prefixing by an action, alternative choice, and parallel composition, a primitive unit-delay operator. For two arguments, processes P and Q, this operator gives a process which behaves as P before the execution of a time event and behaves as Q afterwards. It is shown that several d-unit delay constructs such as timeouts and watchdogs can be expressed in terms of the unit-delay operator and standard process algebra operators. A sound and complete axiomatization for bisimulation semantics is studied and two examples illustrating the adequacy of the language for the description of timed systems are given. Finally we provide a comparison with existing timed process algebras.read more
Citations
More filters
Book ChapterDOI
Timed Automata: Semantics, Algorithms and Tools
Johan Bengtsson,Wang Yi +1 more
TL;DR: In this paper, the authors present the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification for timed systems.
Book
Concurrent and Real-time Systems: The CSP Approach
TL;DR: The second half of the book introduces time into the language, brings in the timed semantic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together.
A brief history of process algebra
TL;DR: The history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science is discussed in this article, where the author gives his personal views on these matters.
Journal ArticleDOI
A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time
Marco Bernardo,Roberto Gorrieri +1 more
TL;DR: An overview of EMPA, a process algebra for modeling and analyzing concurrent systems where nondeterminism, priorities, probabilities and time are present, aiming at a reasonable trade off between the expressive power of the calculus and the complexity of its underlying theory.
Journal ArticleDOI
A Process Algebra for Timed Systems
Matthew Hennessy,T. Regan +1 more
TL;DR: A semantic theory based on testing is developed for the new language and is characterised in terms of barbs, a variety of ready traces and also characterised as the initial theory generated by a set of equations.
References
More filters
Journal ArticleDOI
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Journal ArticleDOI
Statecharts: A visual formalism for complex systems
TL;DR: It is intended to demonstrate here that statecharts counter many of the objections raised against conventional state diagrams, and thus appear to render specification by diagrams an attractive and plausible approach.
Book
A calculus of communicating systems
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Journal ArticleDOI
Calculi for synchrony and asynchrony
TL;DR: It is shown that the author's Calculus of Communicating Systems (1980), which is an asynchronous model, is derivable from the calculus presented here, which models both synchronous and asynchronous computation.
Proceedings ArticleDOI
Model-checking for real-time systems
TL;DR: An algorithm is developed for model checking, that is, for determining the truth of a TCTL formula with respect to a timed graph, and it is argued that choosing a dense domain, instead of a discrete domain, to model time does not blow up the complexity of the model-checking problem.