Results 1 
5 of
5
HighLevel Petri Nets as Type Theories in the Join Calculus
 In Proceedings FOSSACS 2001, volume 2030 of LNCS
, 2001
"... Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, Πi, introduce a hierarchy of type systems of decreasing strictness, ∆i, i ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, Πi, introduce a hierarchy of type systems of decreasing strictness, ∆i, i =0,...,3, and we prove that a join process is typeable according to ∆i if and only if it is (strictly equivalent to) a net of class Πi. In the details, Π0 and Π1 contain, resp., usual place/transition and coloured Petri nets, while Π2 and Π3 propose two natural notions of highlevel net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively. 1
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
, 2007
"... In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. Janicki and Koutny introduced so called stratified order structures (sostructures) to describe such causal semantics. To obtain ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. Janicki and Koutny introduced so called stratified order structures (sostructures) to describe such causal semantics. To obtain algebraic semantics, we redefine our own algebraic approach generating rewrite terms via partial operations of synchronous composition, concurrent composition and sequential composition. These terms are used to produce sostructures which define causal behavior consistent with the (operational) step semantics. For concrete Petri net classes with causal semantics derived from processes minimal sostructures obtained from rewrite terms coincide with minimal sostructures given by processes. This is demonstrated for elementary nets with inhibitor arcs.
Law and Partial Order  Nonsequential Behaviour and Probability in Asynchronous Systems
, 2008
"... ..."
Synthesising and Verifying MultiCore Parallelism in Categories of Nested Code Graphs
, 2008
"... We present the MultiCore layer of the larger Coconut project to support highperformance, highassurance scientific computation. Programs are represented by nested code graphs, using domain specific languages. At the MultiCore level, the language is very restricted, in order to restrict control fl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We present the MultiCore layer of the larger Coconut project to support highperformance, highassurance scientific computation. Programs are represented by nested code graphs, using domain specific languages. At the MultiCore level, the language is very restricted, in order to restrict control flow to nonbranching, synchronising control flow, which allows us to treat multicore parallelism in essentially the same way as instructionlevel parallelism for pipelined multiissue processors. The resulting schedule is then presented as a “locally sequential program”, which, like highquality conventional assembly code in the singlecore case, is arranged for hiding latencies at execution time so that peak performance can be reached, and can also be understood by programmers. We present an efficient, incremental algorithm capable of verifying the soundness of the communication aspects of such programs.
U N I V E R
"... Systems biology is a rapidly growing field which seeks a refined quantitative understanding of organisms, particularly studying how molecular species such as metabolites, proteins and genes interact in cells to form the complex emerging behaviour exhibited by living systems. Synthetic biology is a r ..."
Abstract
 Add to MetaCart
(Show Context)
Systems biology is a rapidly growing field which seeks a refined quantitative understanding of organisms, particularly studying how molecular species such as metabolites, proteins and genes interact in cells to form the complex emerging behaviour exhibited by living systems. Synthetic biology is a related and emerging field which seeks to engineer new organisms for practical purposes. Both fields can benefit from formal languages for modelling, simulation and analysis. In systems biology there is however a tradeoff in the landscape of existing formal languages: some are modular but may be difficult for some biologists to understand (e.g. process calculi) while others are more intuitive but monolithic (e.g. rulebased languages). The first major contribution of this thesis is to bridge this gap with a Language for Biochemical Systems (LBS). LBS is based on the modular Calculus of Biochemical Systems and adds e.g. parameterised modules with subtyping and a notion of nondeterminism for handling combinatorial explosion. LBS can also incorporate other rulebased languages such as Kappa, hence adding modularity to these. Modularity is important for a rational structuring of models but can also be exploited in analysis as