Results 1 
6 of
6
A Framework for Comparing Models of Computation
 IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems
, 1998
"... Abstract—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are e ..."
Abstract

Cited by 245 (54 self)
 Add to MetaCart
Abstract—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly one or exactly zero behaviors. Compositions of processes are processes with behaviors in the intersection of the behaviors of the component processes. The interaction between processes is through signals, which are collections of events. Each event is a valuetag pair, where the tags can come from a partially ordered or totally ordered set. Timed models are where the set of tags is totally ordered. Synchronous events share the same tag, and synchronous signals contain events with the same set of tags. Synchronous processes have only synchronous signals as behaviors. Strict causality (in timed tag systems) and continuity (in untimed tag systems) ensure determinacy under certain technical conditions. The framework is used to compare certain essential features of various models of computation, including Kahn process networks, dataflow, sequential processes, concurrent sequential processes with rendezvous, Petri nets, and discreteevent systems. I.
Elementary Structures in Process Theory (1) Sets with Renaming
, 1997
"... We study a general algebraic framework which underlies a wide range of computational formalisms... ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We study a general algebraic framework which underlies a wide range of computational formalisms...
On the Expressiveness of higher dimensional automata
 EXPRESS 2004, ENTCS
, 2005
"... Abstract In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under i ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Abstract In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under investigation. In particular, I propose four different translations of Petri nets, corresponding to the four different computational interpretations of nets found in the literature. I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the STbisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now welldefined whether members of different models of concurrency are equivalent.
Splitting of Actions, HigherDimensional Automata, and Net Synthesis
 InriaRR
, 1996
"... : The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higherdimensional automata: independence should i ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
: The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higherdimensional automata: independence should in that case be made explicit. These higherdimensional automata are step transition systems in the case of general Petri nets and asynchronous transition systems if we restrict to safe Petri nets. The aim of this report is to show that the synthesis problem for nets can reduce to the synthesis problem of pure nets. For that purpose, we discretize an higherdimensional automaton by splitting its actions and we prove that it is the behaviour of some Petri net if and only if its discretized automaton is the marking graph of some pure Petri net. Keywords: Synthesis Problem for Nets, HigherDimensional Automata, Splitting of Actions (R'esum'e : tsvp) This work was partly supported by the h.c.m...
On the Synthesis of General Petri Nets
, 1996
"... A polynomial algorithm was given by the authors and Bernardinello for synthesizing pure weighted Petri nets from finite labeled transition systems. The limitation to pure nets, serious in practice e.g. for modelling waiting loops in communication protocols, may be removed by a minor adaptation of th ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A polynomial algorithm was given by the authors and Bernardinello for synthesizing pure weighted Petri nets from finite labeled transition systems. The limitation to pure nets, serious in practice e.g. for modelling waiting loops in communication protocols, may be removed by a minor adaptation of the algorithm, working for general Petri nets fired sequentially. The rule of sequential firing reduces also the expressivity of Petri nets, since it forces a concurrent interpretation on every diamond. This limitation may also be removed by leaving sequential transition systems and lifting the algorithm to step transition systems, which amounts to extract the effective contents of the coreflection between Petri step transition sytems and general Petri nets established by Mukund. By the way, the categorical correspondences between transition systems or step transition systems and nets are reexamined and simplified to Galois connections in the usual setting of ordered sets.
UML 2.0 Sequence Diagrams ' Semantics
"... Abstract: Scenario languages are widely used in software development. Typical usage scenarios, forbidden behaviors, test cases and many more aspects can be depicted with graphical scenarios. Scenario languages were introduced into the Unified Modeling Language (UML) under the name of Sequence Diagra ..."
Abstract
 Add to MetaCart
Abstract: Scenario languages are widely used in software development. Typical usage scenarios, forbidden behaviors, test cases and many more aspects can be depicted with graphical scenarios. Scenario languages were introduced into the Unified Modeling Language (UML) under the name of Sequence Diagrams. The 2.0 version of UML changed Sequence Diagrams significantly, the expressiveness of the language was highly increased. However, it was carried out without defining a precise semantics for the language. This paper presents the semantics defined in the specification, collects and categorizes the problems with the current approach, and gives a survey of proposed formal semantics for Sequence Diagrams.