Timing the untimed: terminating successfully while being conservative

Authors:
J. C. M. Baeten;M. R. Mousavi;M. A. Reniers
Affiliations:
Department of Computer Science, Eindhoven University of Technology (TU/e), Eindhoven, The Netherlands;Department of Computer Science, Eindhoven University of Technology (TU/e), Eindhoven, The Netherlands;Department of Computer Science, Eindhoven University of Technology (TU/e), Eindhoven, The Netherlands
Venue:
Processes, Terms and Cycles
Year:
2005

Citing 13
Cited 1

Merge and termination in process algebra

Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Process algebra

Process algebra
Transition system specifications with negative premises

Theoretical Computer Science
The algebra of timed processes, ATP: theory and application

Information and Computation
A process algebra for timed systems

Information and Computation
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
The algebra of communicating processes with empty process

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
A conservative look at operational semantics with variable binding

Information and Computation
Process Algebra with Timing

Process Algebra with Timing
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
A Temporal Calculus of Communicating Systems

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Embedding untimed into timed process algebra: the case for explicit termination

Mathematical Structures in Computer Science
Orthogonal extensions in structural operational semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Action abstraction in timed process algebra: the case for an untimed silent step

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-)extensions of ACP with successful termination. Here, we point out some design decisions which were the possible causes of this misfortune and by taking different decisions, we propose a spectrum of timed process algebras ordered by equational conservativity ordering.