Amanote Research

Amanote Research

    RegisterSign In

What Makes Petri Nets Harder to Verify: Stack or Data?

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-51046-0_8
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

December 18, 2016

Authors
Ranko LazićPatrick Totzke
Publisher

Springer International Publishing


Related search

Ruling Makes It Harder to Convict Dig Thieves

Nature
Multidisciplinary
2001English

Supervisors of Petri Nets

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

Cheap, Smuggled Tobacco Makes It Harder to Give Up Smoking

BMJ
2001English

Stochastic Petri Nets Sensitivity to Token Scheduling Policies

Operations Research Proceedings 2010
2011English

From Code to Coloured Petri Nets: Modelling Guidelines

Lecture Notes in Computer Science
Computer ScienceTheoretical 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

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

Privacy PolicyRefund Policy