Results 1 
8 of
8
Concurrent Derivations as Single Pushout Graph Grammar Processes
, 1995
"... Algebraic graph transformations visually support intuition, have a strong theoretical basis, and provide a formal, implementation independent basis for the description of discretely evolving computational systems and their formal and tractable analysis. Graph grammar models of concurrent systems (pe ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Algebraic graph transformations visually support intuition, have a strong theoretical basis, and provide a formal, implementation independent basis for the description of discretely evolving computational systems and their formal and tractable analysis. Graph grammar models of concurrent systems (petri nets, actor systems) have inspired corresponding semantics developments. Recently this led to the introduction of partial orders of concurrent derivations (concurrent computations). A concurrent derivation (CDer) abstracts from the (sequential) order of rule applications in the sequential derivation and thus can be considered as a concurrent process. Complementary, a morphism between two concurrent derivations expresses that the first is a computational approximation of the second. In this paper we newly introduce nondeterministic concurrent derivations (CTrees) as classes of concurrently equivalent sequential derivation trees. Due to the fact that also infinite computations are represe...
IOS Press Branching processes of general Petri Nets
"... Abstract. We propose a new model of branching processes, suitable for describing the behavior of general Petri nets, without any finiteness or safeness assumption. In this framework, we define a new class of branching processes and unfoldings of a net N, which we call faithful. These coincide with t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We propose a new model of branching processes, suitable for describing the behavior of general Petri nets, without any finiteness or safeness assumption. In this framework, we define a new class of branching processes and unfoldings of a net N, which we call faithful. These coincide with the safe branching processes and unfoldings if N is safe, or weakly safe as in [Engelfriet 1991], but not in general. However, faithful branching processes and processes satisfy the good ordertheoretic properties which make the safe processes of safe nets so useful in practice, and which are known not to hold for the safe processes of a general net. Faithful processes represent therefore good candidates to generalize the theory of safe nets to the general case.
A Reflective Framework for Formal Interoperability
, 1998
"... In practice we find ourselves in constant need of moving back and forth between different formalizations capturing different aspects of a system. For example, in a large software system we typically have very different requirements, such as functional correctness, performance, realtime behavior, co ..."
Abstract
 Add to MetaCart
In practice we find ourselves in constant need of moving back and forth between different formalizations capturing different aspects of a system. For example, in a large software system we typically have very different requirements, such as functional correctness, performance, realtime behavior, concurrency, security, and fault tolerance, which correspond to different views of the system and that are typically expressed in different formal systems. Often these requirements affect each other, but it can be extremely difficult to reason about their mutual interaction, and no tools exist to support such reasoning. This situation is very unsatisfactory, and presents one of the biggest obstacles to the use of formal methods in software engineering because, given the complexity of large software systems, it is a fact of life that no single perspective, no single formalization or level of abstraction suffices to represent a system and reason about its behavior. We need (meta)formal methods and tools to achieve Formal Interoperability, that is, the capacity to move in a mathematically rigorous way across the different formalizations of a system, and to use in a rigorously integrated way the different tools supporting these formalizations. We will develop new, formal interoperability methodologies and generic metatools that are expected to achieve dramatic advances in software technology and formal methods:
Unfoldings for general Petri Nets
, 2004
"... We propose a new model of branching processes, suitable for describing the behavior of general Petri nets, without any finiteness of safeness assumption. In this framework, we define a new class of branching processes and unfoldings of a net N, which we call true. These coincide with the safe branch ..."
Abstract
 Add to MetaCart
(Show Context)
We propose a new model of branching processes, suitable for describing the behavior of general Petri nets, without any finiteness of safeness assumption. In this framework, we define a new class of branching processes and unfoldings of a net N, which we call true. These coincide with the safe branching processes and unfoldings if N is safe, or weakly safe as in [Engelfriet 1991], but not in general. However, true branching processes and processes satisfy the good ordertheoretic properties which make the safe processes of safe nets so useful in practice, and which are known to not hold for the safe processes of a general net. True processes represent therefore good candidates to generalize the theory of safe nets to the general case.
Mathematical and Engineering Foundations for Interoperability via Architecture
, 1998
"... Data Type Specification, in combination with modal logics for formalizing the process of building systems from interconnected components. This combination of logical and categorical techniques has also been applied to parallel program design languages in the style of UNITY [14] and IP [41], providin ..."
Abstract
 Add to MetaCart
Data Type Specification, in combination with modal logics for formalizing the process of building systems from interconnected components. This combination of logical and categorical techniques has also been applied to parallel program design languages in the style of UNITY [14] and IP [41], providing semantics for modularization techniques based on the notion of superposition. This has resulted in the development of a programming design language called Community [33]. Two formalisms that provide explicit support for object systems and can reason about their rewriting logic specifications have been recently developed. One is a version of the modal calculus proposed by Lechner [48, 49] for reasoning about objectoriented Maude specifications. Another is Denker's objectoriented distributed temporal logic DTL + [24, 22], that extends the DTL and D 1 distributed object temporal logics of Ehrich and Denker [30, 23, 29]. Lechner [48, 49] uses her version of the modal calculus to identif...
Faster Unfolding of General Petri Nets
"... We propose two new unfolding semantics for general Petri nets based on the concept of prime event structures. The definitions of the two unfolding models are motivated by algorithmic aspects. We develop a construction algorithm for both unfolding models. The unfolding models employ the idea of token ..."
Abstract
 Add to MetaCart
We propose two new unfolding semantics for general Petri nets based on the concept of prime event structures. The definitions of the two unfolding models are motivated by algorithmic aspects. We develop a construction algorithm for both unfolding models. The unfolding models employ the idea of token flows developed in [JLD05] and are much smaller than the standard unfolding model. We show that they still represent the complete partial order behaviour of the given net. Since the models are smaller, they can be constructed much faster. 1
Claude Jard (ENS Cachan, Antenne de Bretagne) : QoSAware Management of Monotonic
"... Groupement De Recherche CNRS du Génie de la Programmation et du Logiciel ..."