Reinier Post - Academia.edu (original) (raw)

Papers by Reinier Post

The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. In order ... more 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 nets, PNML allows the definition of Petri net types. Due to this flexibility, PNML is a starting point for a standard interchange format for Petri nets. This paper discusses the design principles, the basic concepts, and the underlying XML technology of PNML. The main purpose of this paper is to disseminate the ideas of PNML and to stimulate discussion on and contributions to a standard Petri net interchange format.

Lecture Notes in Computer Science, 2008

A case handling system is an information system supporting the handling of cases. The (sub) tasks... more A case handling system is an information system supporting the handling of cases. The (sub) tasks for a particular case are performed by persons or software agents and the result of a task is the updating of the case data. Case handling systems consist of three parts:(1) ...

Lecture Notes in Computer Science, 2003

In the long history of Petri nets a universe of Petri nets has evolved consisting of an enormousl... more In the long history of Petri nets a universe of Petri nets has evolved consisting of an enormously rich theory, a wide variety of tools, and numerous successful applications and case studies in various application domains. This vast variety is not any more handable for anyone working with Petri nets, which results in the strong need of a structured access

Lecture Notes in Computer Science, 2003

This document defines EPNML 1.1, an XML format used for Petri nets in the web application Petriwe... more This document defines EPNML 1.1, an XML format used for Petri nets in the web application Petriweb and the Petrinet editor Yasper. EPNML 1.1 is an application of PNML, a developing standard XML format for Petri nets: EPNML 1.1 documents are a particular type of PNML documents. 1 EPNML is modified over time to incorporate corrections and extensions. The version described here is EPNML 1.1, first published in October, 2003; this specification has been modified several times since, due to errors found. At the time of writing we are already considering an updated version of the file format itself, which will be called EPNML 1.2; that slightly modified document format is not described here. A formal, but incomplete, syntax definition is included.

The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. PNML supp... more 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 Net Type Definitions (PNTD). In this paper, we present the syntax and the semantics of PNML as well as the principles underlying its design. Moreover, we present an extension called modular PNML, which is a type independent module concept for Petri nets.

Sixth International Conference on Application of Concurrency to System Design (ACSD'06), 2006

This paper presents Yasper, a tool for modeling, analyzing and simulating workflow systems, based... more This paper presents Yasper, a tool for modeling, analyzing and simulating workflow systems, based on Petri nets. Yasper puts Petri net modeling in the hands of business analysts and software architecture designers. They can specify systems in familiar terms (XOR choice, workflow, cases, roles, processing time and cost), and can directly run manual and automatic simulations on the resulting models to analyze correctness and performance. Yasper was designed to cooperate with other tools, such as Petri net analyzers, and off-the-shelf software for data (color) handling and forms handling.

Technology, and Tools, 2003

Computer Networks and ISDN Systems, 1994

... of the Web and because of the diversity of the information offered through the Web. ... To he... more ... of the Web and because of the diversity of the information offered through the Web. ... To help readers find specific information quickly, specific overview documents are often included into the ... Hypertext systems often provide simple searching tools such as full text search or title ...

Stochastic activity networks (SANs) are a stochastic generalization of Petri nets. The original d... more Stochastic activity networks (SANs) are a stochastic generalization of Petri nets. The original definition of SANs has been used as a modeling formalism in several well-known and powerful modeling tools. SANs have been used to evaluate a wide range of systems, mainly for dependability and performability evaluation purposes. SAN models have not been considered in the definition of the Petri net markup language (PNML). Because of the existence of some different primitives and concepts, the current definition of PNML does not cover these models. In this paper, after a brief introduction to SANs, we will introduce a PNML-based interchange format for these models called SAN markup language (SANML). We will also discuss on the possibility of the integration of SANs into PNML.

While the World−Wide Web (WWW, or Web for short) offers an incredibly rich base of information, o... more While the World−Wide Web (WWW, or Web for short) offers an incredibly rich base of information, organized as a hypertext, it does not provide a uniform and efficient way to retrieve specific information, based on user−defined search−criteria. Two types of search tools have been developed for the WWW: Gateways, offering (limited) search operations on small or large parts of the WWW, using a pre−compiled database. These databases are often built by an automated Web scanner (a "robot"). A client−based search tool that does automated navigation, thereby working more or less like a browsing user, but much faster and following an optimized strategy. This paper highlights the properties, implementation and possible future developments of a client−based search tool called the fish−search, and compares it to other approaches. The fish−search, implemented on top of Mosaic for X, offers an open−ended selection of search criteria. It allows the search to start from the "current" document or from the documents in the user's hotlist. The future of client−based searching will depend heavily on assistance from WWW servers. The fish−search algorithm is currently being used to search by navigating through individual WWW documents. Substantial speedup and reduction of network resource consumption will become possible when the same search algorithm is converted to navigate through a Web of servers instead of a Web of documents. In order to implement such a search algorithm, WWW servers need to offer a service similar to that provided by GlimpseHTTP.

Hypertext is a generalization of the conventional linear text into a non-linear text formed byadd... more Hypertext is a generalization of the conventional linear text into a non-linear text formed byadding cross-reference and structural links between different pieces of text. A hypertext can beregarded as an extension of a textual database by adding a link structure among the different textobjects it stores. We present a tool for finding information in a distributed hypertext such as theWorld-Wide Web (WWW). Such a hypertext is a distributed textual database in which text objectsresiding at (the same and) different sites have links to each ...

Proceedings of the 4th RIAO Conference, Oct 1, 1994

Hypertext is a generalization of the conventional linear text into a non-linear text formed by ad... more Hypertext is a generalization of the conventional linear text into a non-linear text formed by adding cross-reference and structural links between different pieces of text. A hypertext can be regarded as an extension of a textual database by adding a link structure among the different text objects it stores. We present a tool for finding information in a distributed hypertext such as the WorldWide Web (WWW). Such a hypertext is a distributed textual database in which text objects residing at (the same and) different sites have links to each other. In such a database retrieval is limited to the transfer of documents with a known name. Names of documents serve as links between different documents, and finding such references names is only possible by parsing documents that have embedded links to other documents. Full-text search in such hypertexts is not feasible because of the discrepancy between the large size of the hypertext and the relatively low bandwidth of the network. We present an information retrieval algorithm for distributed hypertexts, which does an incomplete search through a part of the hypertext. Heuristics determine the selection of the documents that are to be retrieved and searched. A prototype implementation for the WWW, on top of Mosaic for X, is being used by an increasingly large user base.

Proceedings of ACM Hypertext'93--Demonstrations, 1993

Lecture Notes in Computer Science, 2008

Lecture Notes in Computer Science, 2003

Sixth International Conference on Application of Concurrency to System Design (ACSD'06), 2006

Technology, and Tools, 2003

Computer Networks and ISDN Systems, 1994

Proceedings of the 4th RIAO Conference, Oct 1, 1994

Proceedings of ACM Hypertext'93--Demonstrations, 1993