Results 1  10
of
54
Event structure semantics for CCS and related languages
 Computer Science Department, Aarhus University
, 1982
"... rIJ ..."
Deciding Properties for Message Sequence Charts
, 1998
"... Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is p ..."
Abstract

Cited by 52 (9 self)
 Add to MetaCart
Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural languagetheoretic problem over semitraces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable. 1
Concurrent Games and Full Completeness
, 1998
"... A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is ..."
Abstract

Cited by 50 (17 self)
 Add to MetaCart
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is proved for this semantics. 1 Introduction This paper contains two main contributions: ffl the introduction of a new form of game semantics, which we call concurrent games. ffl a proof of full completeness of this semantics for MultiplicativeAdditive Linear Logic. We explain the significance of each of these in turn. Concurrent games Traditional forms of game semantics which have appeared in logic and computer science have been sequential in format: a play of the game is formalized as a sequence of moves. The key feature of this sequential format is the existence of a global schedule (or polarization) : in each (finite) position, it is (exactly) one player's turn to move 1 . This seq...
Distributed monitoring of concurrent and asynchronous systems
, 2005
"... In this paper we study the diagnosis of distributed asynchronous systems with concurrency. Diagnosis is performed by a peertopeer distributed architecture of supervisors. Our approach relies on Petri net unfoldings and event structures, as means to manipulate trajectories of systems with concurre ..."
Abstract

Cited by 36 (16 self)
 Add to MetaCart
In this paper we study the diagnosis of distributed asynchronous systems with concurrency. Diagnosis is performed by a peertopeer distributed architecture of supervisors. Our approach relies on Petri net unfoldings and event structures, as means to manipulate trajectories of systems with concurrency. This article is an extended version of the paper with same title, which appeared as a plenary address in the Proceedings of CONCUR’2003.
DYNAMIC CONGRUENCE vs. PROGRESSING BISIMULATION for CCS
 Fundamenta Informaticae
, 1992
"... Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. ff:ø:fi:nil and ff:fi:nil are woc but ø:fi:nil and fi:nil are not. This fact prevent us from characterizing CCS s ..."
Abstract

Cited by 32 (12 self)
 Add to MetaCart
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. ff:ø:fi:nil and ff:fi:nil are woc but ø:fi:nil and fi:nil are not. This fact prevent us from characterizing CCS semantics (when ø is considered invisible) as a final algebra, since the semantic function would induce an equivalence over the agents that is both a congruence and a bisimulation. In the paper we introduce a new behavioural equivalence for CCS agents, which is the coarsest among those bisimulations which are also congruences. We call it Dynamic Observational Congruence because it expresses a natural notion of equivalence for concurrent systems required to simulate each other in the presence of dynamic, i.e. run time, (re)configurations. We provide an algebraic characterization of Dynamic Congruence in terms of a universal property of finality. Furthermore we introduce Progressing Bisimulatio...
Probabilistic event structures and domains
 Concurrency Theory: 15th International Conference, CONCUR ’04 Proceedings, LNCS
, 2004
"... This paper investigates probability in the presence of causal dependence. More precisely, it studies the process model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells at which immediate conflict arises; in which case probabilistic independence coi ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
This paper investigates probability in the presence of causal dependence. More precisely, it studies the process model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells at which immediate conflict arises; in which case probabilistic independence coincides with causal independence. An event structure is associated with a domain—that of its configurations ordered by inclusion. In domain theory probabilistic processes are denoted by continuous valuations on a domain. A key result of this paper is a representation theorem showing how continuous valuations on the domain of a confusion free event structure correspond to the probabilistic event structures it supports. Via a notion of tests, probabilistic event structures are related to another approach to probabilistic processes, viz. Markov decision processes. Tests and morphisms of event structures point the way to a more general theory in which, for example, event structures need not be confusion free. 1
Relationships between Models of Concurrency
, 1994
"... . Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalized through the medium of category theory. Keywords. Semantics, Concurrency, Models for Concurrency, Categories. Contents 1 Preliminaries 431 2 Deterministic Transition Systems 433 3 Noninterleaving vs. Interleaving Models 436 Synchronization Trees and Labelled Event Structures : : : : : : : : : : : : : : 438 Transition Systems with Independence : : : : : : : : : : : : : : : : : : : : : : 439 4 Behavioural, Linear Time, Noninterleaving Models 441 Semilanguages and Event Structures : : : : : : : : : : : : : : : : : : : : : : : 443 Trace Languages and Event Structures : : : : : : : : : : : : : : : : : : : : : : 446 5 Transition Systems with Independence and Lab...
Domain theory for concurrency
, 2003
"... Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey. ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey.
Causal atomicity
 In CAV, LNCS 4144
, 2006
"... Abstract. Atomicity is an important generic specification that assures that a programmer can pretend blocks occur sequentially in any execution. We define a notion of atomicity based on causality. We model the control flow of a program with threads using a Petri net that naturally abstracts data, an ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
Abstract. Atomicity is an important generic specification that assures that a programmer can pretend blocks occur sequentially in any execution. We define a notion of atomicity based on causality. We model the control flow of a program with threads using a Petri net that naturally abstracts data, and faithfully captures the independence and interaction between threads. The causality between events in the partially ordered executions of the Petri net is used to define the notion of causal atomicity. We show that causal atomicity is a robust notion that many correct programs adopt, and show how we can effectively check causal atomicity using Petri net tools based on unfoldings, which exploit the concurrency in the net to yield automatic partialorder reduction in the statespace. 1