The relational model with relation-valued attributes
Information Systems
Non first normal form relations: An algebra allowing data restructuring
Journal of Computer and System Sciences
Extended algebra and calculus for nested relational databases
ACM Transactions on Database Systems (TODS)
An environment for object-oriented conceptual programming based on PROT nets
Advances in Petri Nets 1988
OBJSA nets: a class of high-level nets having objects as domains
Advances in Petri Nets 1988
ACM Computing Surveys (CSUR)
Petri nets and algebraic specifications
Theoretical Computer Science
Coloured Petri Nets: a high level language for system design and analysis
APN 90 Proceedings on Advances in Petri nets 1990
Boolean lattices of nested relations as a foundation for rule-based database languages
Data & Knowledge Engineering
Income/star: the Petri net simulation concepts
Systems Analysis Modelling Simulation
INCOME/STAR: methodology and tools for the development of distributed information systems
Information Systems - Special issue: distributed information systems in business and management
A relational model of data for large shared data banks
Communications of the ACM
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Form operation by example: a language for office information processing
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
The Many Faces of Query Monotonicity
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Constructs for Modeling Information Systems with Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Dialogue and process design for interactive information systems using Taxis
Proceedings of the SIGOA conference on Office information systems
A component-based Petri net model for specifying and validating cooperative information systems
Data & Knowledge Engineering
Streams, structures, spaces, scenarios, societies (5s): A formal model for digital libraries
ACM Transactions on Information Systems (TOIS)
Product lines for digital information products
Information Systems
DFL: A dataflow language based on Petri nets and nested relational calculus
Information Systems
Robotics and Computer-Integrated Manufacturing
Process Algebra-Based Query Workflows
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Controlling Petri net process models
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Recommendation-based editor for business process modeling
Data & Knowledge Engineering
Petri net + nested relational calculus = dataflow
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
| Hi-index | 0.01 |
The specification of an information system should include a description of structural system aspects as well as a description of the system behavior. In this article, we show how this can be achieved by high-level Petri nets—namely, the so-called NR/T-nets (Nested-Relation/Transition Nets). In NR/T-nets, the structural part is modeled by nested relations, and the behavioral part is modeled by a novel Petri net formalism. Each place of a net represents a nested relation scheme, and the marking of each place is given as a nested relation of the respective type. Insert and delete operations in a nested relational database (NF2-database) are expressed by transitions in a net. These operations may operate not only on whole tuples of a given relation, but also on “subtuples” of existing tuples. The arcs of a net are inscribed with so-called Filter Tables, which allow (together with an optional logical expression as transition inscription) conditions to be formulated on the specified (sub-) tuples. The occurrence rule for NR/T-net transitions is defined by the operations union, intersection, and “negative” in lattices of nested relations. The structure of an NR/T-net, together with the occurrence rule, defines classes of possible information system procedures, i.e., sequences of (possibly concurrent) operations in an information system.