Relation algebra and modal logics
Relational methods in computer science
A relational formalisation of a generic many—valued modal logic
Relational methods for computer science applications
A Coalgebraic presentation of structured transition systems
Theoretical Computer Science
Response time densities in generalised stochastic petri net models
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis
IEEE Transactions on Software Engineering
Realtion-Algebraic Analysis of Petri Nets with RELVIEW
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Using Relation Algebra for the Analysis of Petri Nets in a CASE Tool Based Approach
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Exact computation of minimum feedback vertex sets with relational algebra
Fundamenta Informaticae
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Evaluating sets of search points using relational algebra
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
A Relation-Algebraic Approach to Liveness of Place/Transition Nets
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Modeling a flexible manufacturing cell using stochastic Petri nets with fuzzy parameters
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
A large variety of systems can be modelled by Petri nets. Their formal semantics are based on linear algebra which in particular allows the calculation of a Petri net's state space. Since state space explosion is still a serious problem, efficiently calculating, representing, and analysing the state space is mandatory. We propose a formal semantics of Petri nets based on executable relation-algebraic specifications. Thereupon, we suggest how to calculate the markings reachable from a given one simultaneously. We provide an efficient representation of reachability graphs and show in a correct-by-construction approach how to efficiently analyse their properties. Therewith we cover two aspects: modelling and model checking systems by means of one and the same logic-based approach. On a practical side, we explore the power and limits of relation-algebraic concepts for concurrent system analysis.