Results 1  10
of
41
Rule formats for determinism and idempotence
 In Proceedings of the 3rd International Conference on Fundamentals of Software Engineering (FSEN’09), Lecture Notes in Computer Science, Kish Island
, 2009
"... Abstract. Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotency is a property of binary composition operators requiring that the composition of two identical specifications or programs will re ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Abstract. Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotency is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, we propose two (related) metatheorems for guaranteeing determinism and idempotency of binary operators. These metatheorems are formulated in terms of syntactic templates for operational semantics, called rule formats. We show the applicability of our formats by applying them to various operational semantics from the literature. 1
Splitting bisimulations and retrospective conditions
 Information and Computation
"... Abstract. We investigate conditions in the setting of the algebraic theory about processes known as ACP. We present ACP c, an extension of ACP with guarded commands, and its main models, called its full splitting bisimilation models. The conditions used in the guarded commands are taken from a Boole ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
(Show Context)
Abstract. We investigate conditions in the setting of the algebraic theory about processes known as ACP. We present ACP c, an extension of ACP with guarded commands, and its main models, called its full splitting bisimilation models. The conditions used in the guarded commands are taken from a Boolean algebra. We add two operators for condition evaluation to ACP c; and study their connection with alternative mechanisms found in other extensions of ACP with guarded commands, to wit state operators and signal emission. On purpose to incorporate the past in conditions, we add a retrospection operator on conditions to ACP c.
The Continuous πCalculus: A Process Algebra for Biochemical Modelling
"... Abstract. We introduce the continuous πcalculus, a process algebra for modelling behaviour and variation in molecular systems. Key features of the language are: its expressive succinctness; support for diverse interaction between agents via a flexible network of molecular affinities; and operationa ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce the continuous πcalculus, a process algebra for modelling behaviour and variation in molecular systems. Key features of the language are: its expressive succinctness; support for diverse interaction between agents via a flexible network of molecular affinities; and operational semantics for a continuous space of processes. This compositional semantics also gives a modular way to generate conventional differential equations for system behaviour over time. We illustrate these features with a model of an existing biological system, a simple oscillatory pathway in cyanobacteria. We then discuss future research directions, in particular routes to applying the calculus in the study of evolutionary properties of biochemical pathways. 1
Reniers. Lost in translation: Hybridtime flows vs. realtime transitions
 In Hybrid Systems: Computation and Control
, 2008
"... Abstract. Recently, hybridtime flow systems have been introduced as an extension to timed transition systems, hybrid automata, continuous time evolutions of differential equations etc. Furthermore, a number of notions of bisimulation have been defined on these flow systems reflecting abstraction f ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract. Recently, hybridtime flow systems have been introduced as an extension to timed transition systems, hybrid automata, continuous time evolutions of differential equations etc. Furthermore, a number of notions of bisimulation have been defined on these flow systems reflecting abstraction from certain timing properties. In this paper, we research the difference in abstraction level between this new semantic model of flow systems, and the more traditional model of realtime transition systems. We explore translations between the old and new semantic models, and we give a necessary and sufficient condition, called finiteset refutability, for these translations to be without loss of information. Finally, we show that differential inclusions with an uppersemicontinuous, closed and convex righthand side, are finiteset refutable, and easily extend this result to impuls differential inclusions and hybrid automata.
Hillston (2009): HYPE: a process algebra for compositional flows and emergent behaviour. CONCUR 2009Concurrency Theory
"... Abstract. Several process algebras for modelling hybrid systems have appeared in the literature in recent years. These all assume that continuous variables in the system are modelled monolithically, often with the differential equations embedded explicitly in the syntax of the process algebra expre ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Several process algebras for modelling hybrid systems have appeared in the literature in recent years. These all assume that continuous variables in the system are modelled monolithically, often with the differential equations embedded explicitly in the syntax of the process algebra expression. In HYPE an alternative approach is taken which offers finergrained modelling with each flow or influence affecting a variable modelled separately. The overall behaviour then emerges as the composition of these flows. This approach is supported by an operational semantics which distinguishes states as collections of flows and which is supported by an equivalence which satisfies the property that bisimilar HYPE models give rise to the same sets of continuous behaviours.
Application of Bhave Toolset for System Control and Electronic System Design
"... (BHPC) is a formalism for modelling and analysis of hybrid systems combining process algebras and the behavioural approach for modelling of instantaneous changes and continuous evolution. BHPC is supported by Bhave toolset, containing a tool for a novel way of visualisation of hybrid systems simulat ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
(BHPC) is a formalism for modelling and analysis of hybrid systems combining process algebras and the behavioural approach for modelling of instantaneous changes and continuous evolution. BHPC is supported by Bhave toolset, containing a tool for a novel way of visualisation of hybrid systems simulations mspsvg and a new version of hybrid simulator. We present the latest developments of Bhave toolset and apply it for case studies of system control and mixedsignal systems design.
Action and predicate safety of hybrid processes
, 2004
"... Safety, put simply, means that a certain property, which is considered bad, does not hold at any time, during any of the possible executions of a system. The analysis of safety properties of a model of a system, is an important way to study correctness of a design or implementation. A famous example ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Safety, put simply, means that a certain property, which is considered bad, does not hold at any time, during any of the possible executions of a system. The analysis of safety properties of a model of a system, is an important way to study correctness of a design or implementation. A famous example is that, when studying a design of a nuclear plant, one might want to verify that