Axiomatising finite delay operators
Acta Informatica
Top-down design and the algebra of communicating processes
Science of Computer Programming - Ellis Horwood series in artificial intelligence
Communicating sequential processes
Communicating sequential processes
Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Communication and concurrency
Process algebra
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Converging towards a timed LOTOS standard
Computer Standards & Interfaces
Turning SOS rules into equations
Information and Computation
The algebra of timed processes, ATP: theory and application
Information and Computation
A complete equational axiomatization for prefix iteration
Information Processing Letters
A process algebra for timed systems
Information and Computation
Handbook of logic in computer science (vol. 4)
Axiomatizing prefix iteration with silent steps
Information and Computation
Branching time and abstraction in bisimulation semantics
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 complete equational axiomatization for MPA with string iteration
Theoretical Computer Science
Absolute versus relative time in process algebras
Information and Computation - Special issue on EXPRESS 1997
Discrete time process algebra with silent step
Proof, language, and interaction
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
An Asynchronous Algebra with Multiple Clocks
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
An Equational Axiomatization of Observation Congruence for Prefix Iteration
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
LOTOS enhancement to specify time constraint among non-adjacent actions using first order logic
FORTE '93 Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, VI
Real-time LOTOS and Timed Observations
Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques VIII
Proceedings of the 9th Colloquium on Automata, Languages and Programming
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
An Upward Compatible Timed Extension to LOTOS
FORTE '91 Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, IV
LOTOS-like Process Algebras with Urgent or Timed Interactions
FORTE '91 Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, IV
A Timed Model for Communicating Sequential Processes
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Extending LOTOS towards performance evaluation
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
A constraint-oriented real-time process calculus
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
A timed LOTOS supporting a dense time domain and including new timed operators
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Abstract Timed Observation and Process Algebra
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CTR: A Calculus of Timed Refinement
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Modelling Real-Time Behaviour with an Interval Time Calculus
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
On the Relationships among four Timed Process Algebras
Fundamenta Informaticae
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
Orthogonal extensions in structural operational semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Hi-index | 0.00 |
In ACP-style process algebra the interpretation of a constant atomic action combines action execution with termination. In a setting with timing, different forms of termination can be distinguished: some-time termination, termination before the next clock tick, urgent termination, having terminated. In a setting with the silent action $\tau$, we also have silent termination. This leads to problems with the interpretation of atomic actions in timed theories that involve some form of the empty process or some form of the silent action. Reflection on these problems led to a redesign of basic process algebra, where action execution and termination are separated. Instead of actions as constants, we have action prefix operators. Sequential composition remains a basic operator, and thus we have two basic constants for termination: $\delta$ for unsuccessful termination (deadlock) and $\epsilon$ for successful termination (skip). We can recover standard ACP-style process algebras as subtheories of the new theory. The new approach has definite advantages over the standard approach. The paper contributes to ongoing work on relationships between algebras with different timing features.