State space analysis of Petri nets with relation-algebraic methods

DOI10.1016/j.jsc.2008.04.005zbMath1156.68040OpenAlexW2073745570MaRDI QIDQ2518607

Alexander Fronk, Britta Kehden

Publication date: 16 January 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.005

zbMATH Keywords

Petri netsrelation algebrareachability graphsystems analysisstate space analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (2)

State space analysis of Petri nets with relation-algebraic methods ⋮ Modal algebra and Petri nets

Uses Software

• RelView
• KURE

Cites Work

• Relation-algebraic computation of fixed points with applications
• Decidability of model checking for infinite-state concurrent systems
• State space analysis of Petri nets with relation-algebraic methods
• Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
• Branching Programs and Binary Decision Diagrams
• Evaluating Sets of Search Points Using Relational Algebra
• Relational Methods in Computer Science
• A coalgebraic presentation of structured transition systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: State space analysis of Petri nets with relation-algebraic methods