An Effective Axiomatization for Real Time ACP

Fokkink, Wan; Klusener, Steven

doi:10.1006/inco.1995.1151

Cited by 11 publications

(12 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We give two detailed examples to show how our conservativity format can be applied to practical cases. The examples deal with real time ACP [21] and the πI-calculus [47].…”

Section: Introductionmentioning

confidence: 99%

A Conservative Look at Operational Semantics with Variable Binding

Fokkink

Verhoef

1998

Information and Computation

View full text Add to dashboard Cite

We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechanisms and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework is used to present a conservativity format in operational semantics, which states sufficient criteria to ensure that the extension of a transition system specification with new transition rules does not affect the semantics of the original terms.

show abstract

“…We give two detailed examples to show how our conservativity format can be applied to practical cases. The examples deal with real time ACP [21] and the πI-calculus [47].…”

Section: Introductionmentioning

confidence: 99%

A Conservative Look at Operational Semantics with Variable Binding

Fokkink

Verhoef

1998

Information and Computation

View full text Add to dashboard Cite

show abstract

“…The structure of ACTC is similar to the real time version of ACP presented by Fokkink and Klusener (1995) where a restricted version of assumption parameterized by a set a linear inequalities was introduced. The two main differences between ACTC and the algebra of Klusner et al are: (1) ACTC supports the assumption/reaction reasoning, and (2) Assumption in ACTC can bind the occurrence time of an action with the occurrence times of actions that may occur in the future, which is not allowed in real time ACP.…”

Section: Actc and Related Workmentioning

confidence: 96%

Algebra of Communicating Timing Charts for Describing and Verifying Hardware Interfaces

Berkane¹,

Gandrabur²,

Cerny³

1997

Hardware Description Languages and Their Applications

View full text Add to dashboard Cite

This paper addresses the specification and verification of hardware interface behaviors using an algebra of communicating timing charts (ACTC for short) whose underlying user model is the well known timing diagram. Terms modeling hierarchical timing charts are built in two steps. First, basic terms corresponding to the leaf charts are built, and then hierarchical terms are constructed using hierarchical operators. The basic terms model elementary behaviors as observed at the interface, and the hierarchical terms allow modeling behaviors at a higher level of abstraction: e.g., modeling an exception handling mechanism. We define an equivalence relation over the chart terms which is preserved by all the language constructs, and give a strategy to decide whether two deadlock-free basic terms are equivalent.

show abstract

“…Its practical use lies for example in modelling biological phenomena. Baeten and Bergstra [14] (see also [94]) extended process algebra with dense time by supplying atomic actions with time stamps: the action a with as time stamp the positive real number r represents the action a that is executed at time r.…”

Section: Further Extensionsmentioning

confidence: 99%