Modular Construction of Finite and Complete Prefixes of Petri Net Unfoldings

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2009-148
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Model Checking Using Net Unfoldings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Petri Net Synthesis

Texts in Theoretical Computer Science. An EATCS Series
2015English

Construction and SAT-Based Verification of Contextual Unfoldings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Embedding an Arbitrary 1-Safe Petri Net Into a Boolean Petri Net

International Journal of Computer Applications
2013English

The Downward-Closure of Petri Net Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On the Hierarchy of Petri Net Languages

RAIRO. Informatique théorique
1979English

A Concurrent and Compositional Petri Net Semantics of Preemption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

A Petri Net Interpretation of Open Reconfigurable Systems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Petri Net Applications in Molecular Biology

In Silico Biology
GeneticsMolecular BiologyComputational TheoryComputational MathematicsMedicineMathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy