Results 1  10
of
67
An overview and synthesis on timed process algebras
, 1991
"... We present anoverview and synthesis of existing results about process algebras for the speci cation and analysis of timed systems. The motivation is double: present anoverview of some relevant and representative approaches and suggest a unifying framework for them. time, we propose a general model f ..."
Abstract

Cited by 166 (4 self)
 Add to MetaCart
We present anoverview and synthesis of existing results about process algebras for the speci cation and analysis of timed systems. The motivation is double: present anoverview of some relevant and representative approaches and suggest a unifying framework for them. time, we propose a general model for them: transition systems whose labels are either elements ofavocabulary of actions or elements of a time domain. Many properties of this model are studied concerning their impact on description capabilities and on realisability issues. An overview of the language features of the process algebras considered is presented, by focusing on constructs used to express time constraints. The presentation is organised as an exercise of building a timed process algebra from a standard process algebra for untimed systems. The overview is completed by a discussion about description capabilities according to semantic and pragmatic criteria. 1
Structural Operational Semantics
 Handbook of Process Algebra
, 1999
"... Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and specification languages, which, because of its intuitive appeal and flexibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely use ..."
Abstract

Cited by 148 (19 self)
 Add to MetaCart
Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and specification languages, which, because of its intuitive appeal and flexibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely used in programming language semantics at large, some of its most interesting theoretical developments have taken place within concurrency theory. In particular, SOS has been successfully applied as a formal tool to establish results that hold for whole classes of process description languages. The concept of rule format has played a major role in the development of this general theory of process description languages, and several such formats have been proposed in the research literature. This chapter presents an exposition of existing rule formats, and of the rich body of results that are guaranteed to hold for any process description language whose SOS is within one of these formats. As far as possible, the theory is developed for SOS with features like predicates and negative premises.
Process Algebra for Performance Evaluation
, 2000
"... This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resourcesharing systems  like largescale computers, clientserver architectur ..."
Abstract

Cited by 72 (13 self)
 Add to MetaCart
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resourcesharing systems  like largescale computers, clientserver architectures, networks  can accurately be described using such stochastic specification formalisms.
Process Algebra for Discrete Event Simulation
 In Quantitative Methods in Parallel Systems
, 1993
"... We present a process algebra or programming language, based on CCS, which may be used to describe discrete event simulations with parallelism. It has extensions to describe the passing of time and probabilistic choice, either discrete, between a countable number of processes, or continuous to choose ..."
Abstract

Cited by 55 (3 self)
 Add to MetaCart
We present a process algebra or programming language, based on CCS, which may be used to describe discrete event simulations with parallelism. It has extensions to describe the passing of time and probabilistic choice, either discrete, between a countable number of processes, or continuous to choose a random amount of time to wait. It has a clear operational semantics and we give approaches to denotational semantics given in terms of an algebra of equivalences over processes. It raises questions about when two simulations are equivalent and what we mean by nondeterminism in the context of the specification of a simulation. It also exemplifies some current approaches to adding time and probability to process algebras. 1 Introduction Imagine we wish to simulate the behaviour of a complex system with computerised components, such as a telephone network. First, let us look at the implementation of such a complex system. When it is implemented, typically work will start with some type of ...
A Conservative Look at Operational Semantics with Variable Binding
 INFORMATION AND COMPUTATION
, 1998
"... We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express manysortedness, general binding mechanisms and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework i ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express manysortedness, 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.
Timing and Causality in Process Algebra
 Acta Informatica
, 1992
"... . There has been considerable controversy in concurrency theory between the `interleaving' and `true concurrency' schools. The former school advocates associating a transition system with a process which captures concurrent execution via the interleaving of occurrences; the latter adopts m ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
(Show Context)
. There has been considerable controversy in concurrency theory between the `interleaving' and `true concurrency' schools. The former school advocates associating a transition system with a process which captures concurrent execution via the interleaving of occurrences; the latter adopts more complex semantic structures to avoid reducing concurrency to interleaving. In this paper we show that the two approaches are not irreconcilable. We define a timed process algebra where occurrences are associated with intervals of time, and give it a transition system semantics. This semantics has many of the advantages of the interleaving approach; the algebra admits an expansion theorem, and bisimulation semantics can be used as usual. Our transition systems, however, incorporate timing information, and this enables us to express concurrency: merely adding timing appropriately generalises transition systems to asynchronous transition systems, showing that time gives a link between true concurrenc...
MPA: a Stochastic Process Algebra
, 1994
"... s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via email at the address lastname@cs.unibo.it. UBLCS Technical Report Series 936 Versioning Issues in a Collaborative Distributed Hypertext System, C. Maioli, S. Sol ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
(Show Context)
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via email at the address lastname@cs.unibo.it. UBLCS Technical Report Series 936 Versioning Issues in a Collaborative Distributed Hypertext System, C. Maioli, S. Sola, F. Vitali, April 1993. 937 Distributed Programming with Logic Tuple Spaces, P. Ciancarini, April 1993. 938 Coordinating RuleBased Software Processes with ESP, P. Ciancarini, April 1993. 939 What is Logic Programming good for in Software Engineering?, P. Ciancarini, G. Levi, April 1993. 9310 Scheduling Real Time Tasks: A Performance Study, F. Panzieri, L. Donatiello, L. Poretti, May 1993. 9311 Specification and Verification of Dynamic Properties in Distributed Computations, O. Babao glu, M. Raynal, May 1993. 9312 Interaction Systems II: The Practice of Optimal Reductions, A. Asperti, C. Laneve, May 1993. 9313 Reliability Analysis of TreeBased Structures and its Application to Fa...
Discrete Analysis of Continuous Behaviour in RealTime Concurrent Systems
, 2001
"... This thesis concerns the relationship between continuous and discrete modelling paradigms for timed concurrent systems, and the exploitation of this relationship towards applications, in particular model checking. The framework we have chosen is Reed and Roscoe's process algebra Timed CSP, in w ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
This thesis concerns the relationship between continuous and discrete modelling paradigms for timed concurrent systems, and the exploitation of this relationship towards applications, in particular model checking. The framework we have chosen is Reed and Roscoe's process algebra Timed CSP, in which semantic issues can be examined from both a denotational and an operational perspective. The continuoustime model we use is the timed failures model; on the discretetime side, we build a suitable model in a CSPlike setting by incorporating a distinguished tock event to model the passage of time. We study the connections between these two models and show that our framework can be used to verify certain speci cations on continuoustime processes, by building upon and extending results of Henzinger, Manna, and Pnueli's. Moreover, this veri cation can in many cases be carried out directly on the model checker FDR . Results are illustrated with a small railway level crossing case study. We also construct a second, more sophisticated discretetime model which reects continuous behaviour in a manner more consistent with one's intuition, and show that our results carry over this second model as well.
Digitisation and full abstraction for densetime model checking
 In Proceedings of TACAS 02
, 2002
"... Abstract. We study the digitisation of densetime behaviours of timed processes, and show how this leads to exact verification methods for a large class of densetime specifications. These specifications are all closed under inverse digitisation, a robustness property first introduced by Henzinger, ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
(Show Context)
Abstract. We study the digitisation of densetime behaviours of timed processes, and show how this leads to exact verification methods for a large class of densetime specifications. These specifications are all closed under inverse digitisation, a robustness property first introduced by Henzinger, Manna, and Pnueli (on timed traces), and extended here to timed failures, enabling us to consider liveness issues in addition to safety properties. We discuss a corresponding model checking algorithm and show that, in many cases, automated verification of such densetime specifications can in fact be directly performed on the model checker FDR (a commercial product of Formal Systems (Europe) Ltd.). We illustrate this with a small case study (the railway level crossing problem). Finally, we show that integral—or digitised—behaviours are fully abstract with respect to specifications closed under inverse digitisation, and relate this to the efficiency of our model checking algorithm. 1
A Comparison of Additivity Axioms in Timed Transition Systems
, 1993
"... This paper discusses some axioms from the literature which have been used to define properties of timed transition systems. The additivity axiom proposed by (amongst others) Wang, and Nicollin and Sifakis is compared with the trajectory axiom of Lynch and Vaandrager. Some conditions for an additive ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper discusses some axioms from the literature which have been used to define properties of timed transition systems. The additivity axiom proposed by (amongst others) Wang, and Nicollin and Sifakis is compared with the trajectory axiom of Lynch and Vaandrager. Some conditions for an additive transition system to be trajectoried are discussed. These are proved sufficient by using some simple terminology from category theory to show how this problem about timed transition systems can be turned into an equivalent problem about monotone functions on partially ordered sets. We also discuss trajectory (bi)simulation, which is a variant of HoStuart's path bisimulation, and use similar techniques to discuss when (bi)simulation is equivalent to trajectory (bi)simulation.