Results 1 
5 of
5
The Semantic Challenge of VERILOG HDL
 In the Proc. of Tenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer
, 1995
"... ..."
(Show Context)
Denotational Semantics for ProcessBased Simulation Languages. Part I: piDemos
, 1997
"... In this paper we present a method for translating the synchronisation behaviour of a process oriented discrete event simulation language into a process algebra. Such translations serve two purposes. The first exploits the formal structure of the target process algebraic representations to provide pr ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
In this paper we present a method for translating the synchronisation behaviour of a process oriented discrete event simulation language into a process algebra. Such translations serve two purposes. The first exploits the formal structure of the target process algebraic representations to provide proofs of properties of the source system (such as deadlock freedom, fairness, liveness, ...) which can be very difficult to establish by simulation experiment. The second exploits the denotational semantics to better understand the language constructs as abstract entities and to reason about simulation models. Here we give the intuition and present the basic mechanisms using the ßDemos simulation language and the CCS and SCCS process algebras. The analysis of the synchronisations of full Demos is treated in a companion paper.
Specification and analysis of soft realtime systems: quantity and quality
 In: RTSS’99
, 1999
"... This paper presents a process algebra for specifying soft realtime constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arbitrary probability distributions to express delays of activities. The semantics of this process algebra is given in terms ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
This paper presents a process algebra for specifying soft realtime constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arbitrary probability distributions to express delays of activities. The semantics of this process algebra is given in terms of stochastic automata, a variant of timed automata where clocks are initialised randomly and run backwards. To analyse quantitative properties, an algorithm is presented for the onthefly generation of a discreteevent simulation model from a process algebra specification. On the qualitative side, a symbolic technique for classical reachability analysis of stochastic automata is presented. As a result a unifying framework for the specification and analysis of quantitative and qualitative properties is obtained. We discuss an implementation of both analytic methods and specify and analyse a faulttolerant multiprocessor system. 1.
The Application of a Resource Logic to the NonTemporal Analysis of Processes Acting on Resources
, 2003
"... This document, in order to maintain a concise notation, shall consider only a subclass of Demos programs, the syntax of which is given in BackusNaur form in Figure 2.1. Notably, this does not include variables, or bins or synchronisations with values ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This document, in order to maintain a concise notation, shall consider only a subclass of Demos programs, the syntax of which is given in BackusNaur form in Figure 2.1. Notably, this does not include variables, or bins or synchronisations with values
Relating Operational and Denotational Descriptions of πDemos
, 1996
"... In previous papers we have presented operational and denotational accounts of the semantics ßDemos, a small processoriented simulation language based upon Simula and Demos. The operational semantics provide precise formal descriptions of synchronisations and event list mechanisms and can be used t ..."
Abstract
 Add to MetaCart
In previous papers we have presented operational and denotational accounts of the semantics ßDemos, a small processoriented simulation language based upon Simula and Demos. The operational semantics provide precise formal descriptions of synchronisations and event list mechanisms and can be used to guide implementations and reason about the execution of a specific program. The denotational semantics are at a much more abstract level. By abstracting away from distributions and queueing disciplines they make it possible to reason about properties such as deadlock over all possible runs of a model. In this paper we state and prove a formal relationship which holds between the two forms of semantics, namely that any behaviour permitted by the operational definition can be matched by the denotational account. Hence any properties that can be proved to hold for the behaviours of the denotational account must hold for the limited subset of behaviours observed for the operational account. Th...