Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
The equational theory of pomsets
Theoretical Computer Science
B-fairness and structural B-fairness in Petri Net models of concurrent systems
Journal of Computer and System Sciences
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Synthesizing Monitors for Safety Properties
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Algebraic Characterization of Petri Net Pomset Semantics
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Elements of General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
Some Constructions for Order-Theoretic Models of Concurrency
Proceedings of the Conference on Logic of Programs
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
Automata-Based Verification of Temporal Properties on Running Programs
Proceedings of the 16th IEEE international conference on Automated software engineering
Monitoring Programs Using Rewriting
Proceedings of the 16th IEEE international conference on Automated software engineering
Domain and event structure semantics for Petri nets with read and inhibitor arcs
Theoretical Computer Science
LogLogics: A logic for history-dependent business processes
Science of Computer Programming
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
History-dependent automata: an introduction
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
Data and abstraction for scenario-based modeling with petri nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Hi-index | 0.00 |
Most information systems that are driven by processmodels (e.g., workflowmanagement systems) record events in event logs, also known as transaction logs or audit trails. We consider processes that not only keep track of their history in a log, but also make decisions based on this log. To model such processes we extend the basic Petri net framework with the notion of history and add guards to transitions evaluated on the process history. We show that some classes of historydependent nets can be automatically converted to classical Petri nets for analysis purposes. Some of these classes are characterized by the form of the guards (e.g., LTL+Past guards), while others by restrictions on the underlying classical Petri net.