Discrete time process algebra with silent step

Authors:
J. C. M. Baeten;J. A. Bergstra;M. A. Reniers
Affiliations:
-;-;-
Venue:
Proof, language, and interaction
Year:
2000

Citing 0
Cited 10

Completeness of timed #CRL

Fundamenta Informaticae
Embedding untimed into timed process algebra: the case for explicit termination

Mathematical Structures in Computer Science
Located actions in process algebra with timing

Fundamenta Informaticae
Process algebra for hybrid systems

Theoretical Computer Science - Process algebra
Performance Evaluation of Distributed Systems Based on a Discrete Real- and Stochastic-Time Process Algebra

Fundamenta Informaticae - Application of Concurrency to System Design
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
Equational reasoning on ad hoc networks

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Performance Evaluation of Distributed Systems Based on a Discrete Real- and Stochastic-Time Process Algebra

Fundamenta Informaticae - Application of Concurrency to System Design
Located Actions in Process Algebra with Timing

Fundamenta Informaticae
Completeness of Timed μCRL

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract