Amanote Research

Amanote Research

    RegisterSign In

Compositional Reachability in Petri Nets

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-11439-2_18
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Julian RathkePaweł SobocińskiOwen Stephens
Publisher

Springer International Publishing


Related search

The Reachability Problem for Petri Nets Is Not Elementary

2019English

On State-Space Compression and State Reachability Retrieval of Petri Nets

Advances in Mechanical Engineering
Mechanical Engineering
2019English

Petri Nets Compositional Modeling and Verification of Flexible Manufacturing Systems

2011English

A Class of Petri Nets That a Necessary and Sufficient Condition for Reachability Is Obtainable

Transactions of the Society of Instrument and Control Engineers
1988English

Cycle Folding in Petri Nets

Science Bulletin of the Novosibirsk State Technical University
2015English

Supervisors of Petri Nets

Research Papers Faculty of Materials Science and Technology Slovak University of Technology
2019English

Timed Petri Nets and BQOs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Parametrisation of Coloured Petri Nets

DAIMI Report Series
1997English

Checking Subsystem Safety Properties in Compositional Reachability Analysis

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy