Checking Linear Temporal Formulas on Sequential Recursive Petri Nets

doi 10.1109/time.2001.930718
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc

Related search

Advanced Saturation-Based Model Checking of Well-Formed Coloured Petri Nets

Periodica polytechnica Electrical engineering and computer science
Electronic EngineeringInformation SystemsSignal ProcessingComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
2014English

On Categories of Fuzzy Petri Nets

Advances in Fuzzy Systems
ControlComputational MathematicsOptimizationSystems Engineering
2011English

On-Line Model-Checking for Finite Linear Temporal Logic Specifications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Supervisors of Petri Nets

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

On Minimality and Equivalence of Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Compositional Reachability in Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Timed Petri Nets and BQOs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Parametrisation of Coloured Petri Nets

DAIMI Report Series
1997English

Cycle Folding in Petri Nets

Science Bulletin of the Novosibirsk State Technical University
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy