Ekkart Kindler, Vladimir Rubin, Wilhelm Schäfer
Abstract. Incremental workflow mining is a technique for automatically deriving a process model from the on-going executions of a process. This way, the process model becomes more and more accurate,...
The Petri Net Markup Language and ISO/IEC 15909-2: Concepts, Status, and Future Directions (2008)
Abstract: The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. In order to support different versions of Petri nets, its focus is on universality and flexibility,...
Incremental Workflow Mining for Process Flexibility (2008)
Ekkart Kindler, Vladimir Rubin, Wilhelm Schäfer
Abstract. Incremental workflow mining is a technique for automatically deriving a process model from the on-going executions of a process. This way, the process model becomes more and more accurate,...
ABSTRACT Reconciling Scenario-Centered Controller Design with State-Based System Models ∗ (2008)
Holger Giese, Ekkart Kindler, Florian Klein, Robert Wagner
Scenarios are an effective means for defining the expected behavior of a system during the design and implementation phase. The ‘Come Let’s Play ’ approach has demonstrated that scenarios can...
V.: AMFIBIA: A Meta-Model for the Integration of Business Process Modelling Aspects (2008)
Björn Axenath, Ekkart Kindler, Vladimir Rubin
Abstract. AMFIBIA is a meta-model that formalizes the essential aspects and concepts of business process modelling. Though AMFIBIA is not the first approach to formalizing the aspects and concepts of...
Track – Declarative – Relational – Graph-patternbased (2008)
Joel Greenyer, Dr. Ekkart Kindler, Robert Wagner, Example Rule Tracktoplacearctransition
context relation/ transformation
Ekkart Kindler, Markus Nüttgens (eds, Ekkart Kindler, Markus Nüttgens, Wiso Fakultät
Reference models for business processes have been a successful means for designing, redesigning, tailoring, and implementing business processes. Still there is no common understanding of reference...
● Graph structure: Variables and OCL- Predicates ● One Trace Class (2008)
Joel Greenyer, Dr. Ekkart Kindler, Robert Wagner, Qvt-core Tgg
– Many techniques, different strenghts and weaknesses
Process Mining Framework for Software Processes (2008)
Vladimir Rubin, Christian W. Günther, Ekkart Kindler, Wilhelm Schäfer
Abstract. Software development processes are often not explicitly modelled and sometimes even chaotic. In order to keep track of the involved documents and files, engineers use Software Configuration...
ILF and DAWN for Verifying Distributed Algorithms { An Idea for a Tool{ (2007)
Designing a proof in such a way that it can be automatically checked for correctness is a hard task. The task becomes even harder, if the proof should be intuitive and easily comprehensible. The...
The Petri Net Markup Language (2007)
Fachberichte Informatik, Matthias Jngel, Ekkart Kindler, Michael Weber
Humboldt-Universitt zu Berlin
Cross-talk revisited: What's the problem? (2007)
Cover Picture Story, Ekkart Kindler, Axel Martens
Introduction About ve years ago, Rolf Walter proposed a simple communication protocol, which he called cross-talk protocol 1 [5, 4]. He gave a nice Petri net model (see cover picture of the Petri Net...
Liveness, Fairness, and Recurrence in Petri Nets (2007)
this paper, we will investigate the reverse direction of this implication. In particular, we will characterize a class of Petri nets for which liveness implies recurrence. Basically, this class is...
Liveness, Fairness, and Recurrence in Petri Nets (2007)
this paper, we will investigate the reverse direction of this implication. In particular, we will characterize a class of Petri nets for which liveness implies recurrence. Basically, this class is...
Application Oriented Verification Scenarios (2007)
Ekkart Kindler, Tobias Vesper, Michael Weber
this paper, we will discuss how formal verication techniques can be employed to increase the
Ekkart Kindler, Tobias Vesper Michael, Michael Weber
this paper, we will discuss how formal verication techniques can be employed to increase the condence in the correctness of a system. Moreover, we will show how these techniques t into the Petri Net...
Serializability, Concurrency Control, and Replication Control (2007)
Transaction management comprises different aspects such as concurrency control, recovery control, and replication control. Usually, only one or at least two of these aspects are considered in...
A Specification and Verification Method for Caching Protocols (2007)
Caching protocols have gained great significance in distributed systems since they increase efficiency of data accesses. The main idea is to keep several copies of a (virtual) object at different...
Jonathan Billington, Sren Christensen, Kees Van Hee, Ekkart Kindler, Laure Petrucci, Reinier Post, ...
8 1
Software Engineering Education: The Synergy of Combined Research and Teaching (2007)
Matthias Gehrke, Holger Giese, Ekkart Kindler, Jörg Niere, Wilhelm Schäfer, Jörg P. Wadsack, ...
Teaching software engineering is a sumptuous task. In particular, practical software engineering courses require a lot of experienced teaching staff, who are, as a result, kept away from research...
Abstract. The flexibility of Petri nets that allows us the combination of components without restriction to a single general composition operator is an important advantage of Petri nets compared to...
Consistency, Causality, Petri Nets, and Automata (2007)
In previous work, we have proposed arc-typed Petri nets [10] for the modelling and veri cation of consistency protocols. Basically, an arc-typed Petri net is an algebraic Petri net equipped with...
Inter-Operability of Work ow Applications: Local Criteria for Global Soundness (2007)
Ekkart Kindler, Axel Martens, Wolfgang Reisig
Abstract. Automatic analysis techniques for business processes are crucial for today's work ow applications. Since business processes are rapidly changing, only fully automatic techniques can...
AMFIBIA: A Meta-Model for the Integration of Business Process Modelling Aspects (2006)
Kindler, Ekkart, Axenath, Björn, Rubin, Vladimir
Today, there are many different formalisms and notations for modelling business processes. Though most of the formalisms have their justification, the plethora of notations makes it hard to compare...
Ekkart Kindler, Markus Nüttgens, J. Becker, J. V. Brocke, C. Bussler, P. Dadam, ...
Proceedings of the Workshop on
Björn Axenath, Ekkart Kindler, Vladimir Rubin
Abstract. It is now well-established, that there are three important aspects of business processes: the behaviour aspect, the information aspect, and the organisation aspect. Dependent on the...
On the Semantics of EPCs: Faster Calculation for EPCs with Small State Spaces (2005)
Nicolas Cuntz, Jörn Freiheit, Ekkart Kindler
Abstract: One of the main features of Event driven Process Chains (EPCs) is the non-local semantics of the OR-join and the XOR-join connectors. Simulating this non-local semantics faithfully and...
On the semantics of EPCs: Faster calculation for {EPCs} with small state spaces (2005)
Cuntz, Nicolas, Freiheit, Jörn, Kindler, Ekkart, Nuettgens, Markus, Rump, Frank J.
3D-Visualization of Petri Net Models: Concept and Realization (2004)
Abstract. We present a simple concept for a 3D-visualization of systems that are modelled as a Petri net. To this end, the Petri net is equipped with some information on the physical objects...
On the Semantics of EPCs: A Framework for Resolving the Vicious Circle (2004)
is their non-local semantics. Most non-local semantics for EPCs either have a formal flaw or are given informally only. In fact, it can be shown that there is no formal semantics that precisely...
Ekkart Kindler, Ekkart Kindler (ed, Ekkart Kindler
Proceedings of the Workshop on the
Abstract The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. Its focus is on universality and flexibility, which is achieved by a technique for defining new Petri...
On the semantics of EPCs: Efficient calculation and simulation (2004)
is their non-local semantics, which results in some difficulties when defining a formal semantics for EPCs. Recently, we have overcome these problems by using techniques from fixed-point theory for...
The Petri net markup language (2003)
Billington, Jonathan, Christensen, Soren, Van Hee, Kees, Kindler, Ekkart, Kummer, Olaf, Petrucci, Laure, ...
The Petri net markup language: Concepts, technology, and tools (2003)
Jonathan Billington, Søren Christensen, Kees Van Hee, Ekkart Kindler, Olaf Kummer, Laure Petrucci, ...
Abstract. The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. In order to support different versions of Petri nets and, in particular, future versions of Petri...
The Petri Net Kernel (PNK) [10, 9] is an infrastructure for building Petri net toolsit is not a Petri net tool itself. The Petri Net Kernel relieves the programmer of a Petri net tool from...
The Petri net markup language (2003)
Billington, Jonathan, Christensen, Soren, Van Hee, Kees, Kindler, Ekkart, Kummer, Olaf, Petrucci, Laure, ...
The Petri net markup language (2003)
Billington, Jonathan, Christensen, Soren, Van Hee, Kees, Kindler, Ekkart, Kummer, Olaf, Petrucci, Laure, ...
On the Semantics of EPCs: A Vicious Circle (2002)
Abstract: Recently, Nüttgens and Rump proposed a formal semantics for Event driven Process Chains (EPCs), which should be fully compliant with the informal semantics of EPCs. But, their semantics...
On the Semantics of EPCs: A Vicious Circle (2002)
Abstract: Recently, Nüttgens and Rump proposed a formal semantics for Event driven Process Chains (EPCs), which should be fully compliant with the informal semantics of EPCs. But, their semantics...
Abstract The Petri Net Markup Language (PNML) is a proposal for an interchange format for Petri nets, which supports all kinds of Petri net types. New extensions to Petri nets can be easily dened as...
The Petri Net Kernel: An Infrastructure for Building Petri Net Tools (2001)
The Petri Net Kernel is an infrastructure for building Petri net tools. It relieves the programmer of a Petri net tool from implementing standard functionality on Petri nets. In this paper, we briey...
The Petri Net Markup Language (2000)
Michael Weber, Ekkart Kindler, Fakultät Für Informatik
Abstract. The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. PNML supports any version of Petri net since new Petri net types can be defined by so-called Petri...
The Petri Net Markup Language (2000)
Matthias Jngel, Ekkart Kindler, Michael Weber
Humboldt-Universitt zu Berlin
Towards a Generic Interchange Format for Petri Nets. In: Bastide et al (2000)
Matthias Jngel, Ekkart Kindler, Michael Weber
XML is vogue! An XML based interface is a sales argument for today's software products. Consequently, many software developers have started to design and to implement an XML based interface for...
Towards a Generic Interchange Format for Petri Nets - Position Paper (2000)
Matthias Jüngel, Ekkart Kindler, Michael Weber
Petri Net Notation [1] can serve as a guideline for this discussion. 4 Issues Hitherto, we focussed our discussion on being generic. Of course, there are other important issues that should be kept in...
Meeting on XML/SGML based Interchange Formats for Petri Nets (2000)
Remi Bastide, Jonathan Billington, Ekkart Kindler, Fabrice Kordon, Kjeld H. Mortensen, M. Jüngel, ...
Petri Net Notation [1] can serve as a guideline for this discussion. 4 Issues Hitherto, we focussed our discussion on being generic. Of course, there are other important issues that should be kept in...
The Petri Net Markup Language (2000)
Matthias Jüngel, Ekkart Kindler, Michael Weber
Petri Net Notation (APNN) [BKK95] and the results of the questionnaire, which was provided and evaluated by Sy et al. [SBB + 00]. 5 Conclusions This paper presents, in its rst version 6 , the...
Towards a Generic Interchange Format for Petri Nets - Position Paper (2000)
Matthias Jüngel, Ekkart Kindler, Michael Weber
Petri Net Notation [1] can serve as a guideline for this discussion. 4 Issues Hitherto, we focussed our discussion on being generic. Of course, there are other important issues that should be kept in...
Towards a Generic Interchange Format for Petri Nets. In: Bastide et al (2000)
Matthias Jüngel, Ekkart Kindler, Michael Weber
XML is in vogue! An XML based interface is a sales promotion for today’s software products.
Verifying Intuition - ILF checks DAWN proofs (1999)
Thomas Baar, Ekkart Kindler, Hagen Völzer
The DAWN approach allows to model and verify distributed algorithms in an intuitive way. At a first glance, a DAWN proof may appear to be informal. In this paper, we argue that DAWN proofs are formal...
The Petri Net Kernel: An Infrastructure for Building Petri Net Tools (1999)
The Petri Net Kernel is an infrastructure for building Petri net tools. It relieves the programmer of a Petri net tool from implementing standard functionality on Petri nets. In this paper, we...
Flexibility in algebraic nets (1998)
Abstract. Algebraic Petri nets as defined by Reisig [15] lack a feature for modelling distributed network algorithms, viz. flexible arcs. In this paper we equip algebraic Petri nets with flexible...
The dimensions of Petri nets: The Petri Net Cube (1998)
y There exist many different Petri net formalisms. In this paper, we present the Petri Net Cube which helps to structure and classify the variety of Petri net formalisms. We show, that three basic...
ESTL: A temporal logic for events and states (1998)
Abstract. In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus...
this documentation and the Petri Net Kernel itself. We apologize for any shortcomings due to the quick process of creation of the English documentation.
Beyond Asymmetric Choice: A note on some extensions (1998)
this paper, we explore further generalizations of asymmetric choice nets. In an asymmetric choice net, it is not allowed that two transitions compete for a token in a shared input place while they...
Proving Correctness of Distributed Algorithms A Petri Net Approach (1998)
In this paper we argue that high-level Petri nets are well suited for the representation of distributed algorithms as well as for correctness proofs. A variant of Raymond's message-passing...
A Temporal Logic for Events and States in Petri Nets (1997)
In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a...
Petrinetzmodelle zur Verifikation Verteilter Algorithmen (1996)
Walter, Rolf, Völzer, Hagen, Vesper, Tobias, Reisig, Wolfgang, Kindler, Ekkart, Freiheit, Jörn, ...
Petrinetzmodelle zur Verifikation Verteilter Algorithmen (1996)
Walter, Rolf, Völzer, Hagen, Vesper, Tobias, Reisig, Wolfgang, Kindler, Ekkart, Freiheit, Jörn, ...
Algebraic System Nets for Modelling Distributed Algorithms (1996)
Ekkart Kindler, Wolfgang Reisig
this paper. Multiset-signatures and-algebras In an algebraic system net a token on a place is an element of a domain of some algebra. Then, the multitude of tokens on a particular place can be...
A Compositional Partial Order Semantics for Petri Net Components (1996)
In this paper we introduce the concept of a Petri net component and show how systems can be composed from components. A component communicates with its environment via distinguished input and output...
Petri Net Based Verification of Distributed Algorithms: An Example (1996)
Ekkart Kindler, Wolfgang Reisig, Hagen Völzer, Rolf Walter
A technique to describe and to verify distributed algorithms is suggested. This technique (based on Petri nets) reduces the modelling- and analysis effort to a reasonable expenditure. The paper...
E. Kindler, R. Walter, Ekkart Kindler, Ekkart Kindler, Rolf Walter, Rolf Walter
We formally introduce arc-typed nets as a model for causality based specifications. The new feature of arc-typed nets is the distinction of different arc-types; the different arc-types carry over to...
The Dimensions of Petri Nets: The Petri Net Cube
Kindler, Ekkart, Weber, Michael
There exist many different Petri net formalisms. In this paper, we present the Petri Net Cube which helps to structure and classify the variety of Petri net formalisms. We show, that three basic...
The Dimensions of Petri Nets: The Petri Net Cube
Kindler, Ekkart, Weber, Michael
There exist many different Petri net formalisms. In this paper, we present the Petri Net Cube which helps to structure and classify the variety of Petri net formalisms. We show, that three basic...
Safety and Liveness Properties: A Survey
Ekkart Kindler, Unter Den Linden
The distinction of safety and liveness properties is often adopted in specification and design methods for distributed systems. We present a short survey on the "history" of these concepts...