Full abstraction of a real-time denotational semantics for an OCCAM-like language

Huizing, Cornelis; Gerth, Rob; deRoever, W.P.

doi:10.1145/41625.41645

Cited by 30 publications

(23 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is important especially when only a few components of a large Statechart change, a waste of resources by re-compiling the large Statechart will not take place. Theoretical studies constructed by Huizing [10] showed that one cannot combine the features of causality, synchrony hypothesis and compositionality with a step semantics which labels transitions by sets of "input/output" events. G. Lüttgen, M. von der Beeck and R. Cleaveland [12] presented an approach to define Statecharts' semantics.…”

Section: Related Workmentioning

confidence: 99%

The Equivalence of Statecharts

Quan

Qiu

Qin

2003

Formal Methods and Software Engineering

View full text Add to dashboard Cite

The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details. Abstract. This paper proposes a compositional operational semantics for a nontrivial subset of Statecharts and defines an equivalence relation between Statecharts using bisimulation on configurations. An input/response trace model is also investigated at the level of observable behaviour.

show abstract

Section: Related Workmentioning

confidence: 99%

The Equivalence of Statecharts

Quan

Qiu

Qin

2003

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

“…and all of our higher-level constructs are derived from it. In several ways it syntactically resembles the variants of real-time CSP found in [7] and [11]. Yet it includes many additional features that take full advantage of our priority semantics.…”

Section: Overview Of Csrmentioning

confidence: 99%

“…To accomplish this, event synchronization between processes is limited to one sender, and one receiver. Lately,'variants of this semantics have been used to model a real-time version of occam [7], Statecharts [8] and a design language for distributed, reactive systems [13].…”

Section: May 7 1989mentioning

confidence: 99%

See 1 more Smart Citation

Communicating Shared Resources: A Model for Distributed Real-Tim Systems (MS-CIS-89-26)

Gerber¹,

Lee²

1989

View full text Add to dashboard Cite

“…In addition to the communications at any point of time, the model includes information about those processes waiting to send or waiting to receive messages on their channels at any given time. (The need for this additional information in a compositional framework follows from the fact that this information is present in the fully abstract semantics given in [HGR87] for a similar language.) Using this information, the formalism enforces minimal waiting in our maximal parallelism model by requiring that no pair of processes is ever simultaneously waiting to send and waiting to receive, respectively, on a shared channel.…”

Section: Computational Modelmentioning

confidence: 99%

A compositional proof system for real-time systems based on explicit clock temporal logic

Hooman¹,

Kuiper²,

Zhou³

Proceedings of the Sixth International Workshop on Software Specification and Design

View full text Add to dashboard Cite

To specify and verify real-time systems, we consider a real-time version of temporal logic which is called Explicit Clock Temporal Logic. Timing properties are specified by simply ext.ending the classical framework of temporal logic with a special variable which explicitly refers to a global notion of time. Programs are written in an Occam-like real-time language in which concurrent processes communicate by synchronous message passing along channels. A proof system is provided to formally verify that a program satisfies a specification expressed in this logic. The proof system is compositional, that is, the verification of a complex statement can be done on the basis of the verifications of its components, without knowing the implementation of them. This allows splitting the verification of large systems into the verification of subsystems. The proof system is shown to be sound and relatively complete.

show abstract

Full abstraction of a real-time denotational semantics for an OCCAM-like language

Cited by 30 publications

References 19 publications

The Equivalence of Statecharts

The Equivalence of Statecharts

Communicating Shared Resources: A Model for Distributed Real-Tim Systems (MS-CIS-89-26)

A compositional proof system for real-time systems based on explicit clock temporal logic

Contact Info

Product

Resources

About