[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/647444.727062guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Decidability and Complexity of Petri Net Problems - An Introduction

Published: 01 September 1996 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2019)Negotiation as concurrency primitiveActa Informatica10.1007/s00236-018-0318-956:2(93-159)Online publication date: 1-Mar-2019
  • (2018)Securing the Integrity of Workflows in IoTProceedings of the 2018 International Conference on Embedded Wireless Systems and Networks10.5555/3234847.3234908(252-257)Online publication date: 16-Feb-2018
  • (2018)Efficient Algorithms for Asymptotic Bounds on Termination Time in VASSProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209191(185-194)Online publication date: 9-Jul-2018
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
September 1996
681 pages
ISBN:3540653066

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 September 1996

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 31 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2019)Negotiation as concurrency primitiveActa Informatica10.1007/s00236-018-0318-956:2(93-159)Online publication date: 1-Mar-2019
  • (2018)Securing the Integrity of Workflows in IoTProceedings of the 2018 International Conference on Embedded Wireless Systems and Networks10.5555/3234847.3234908(252-257)Online publication date: 16-Feb-2018
  • (2018)Efficient Algorithms for Asymptotic Bounds on Termination Time in VASSProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209191(185-194)Online publication date: 9-Jul-2018
  • (2018)Compact and efficiently verifiable models for concurrent systemsFormal Methods in System Design10.1007/s10703-018-0316-053:3(407-431)Online publication date: 1-Dec-2018
  • (2018)Parameterized model checking of rendezvous systemsDistributed Computing10.1007/s00446-017-0302-631:3(187-222)Online publication date: 1-Jun-2018
  • (2017)On verifying causal consistencyACM SIGPLAN Notices10.1145/3093333.300988852:1(626-638)Online publication date: 1-Jan-2017
  • (2017)Stop It, and Be Stubborn!ACM Transactions on Embedded Computing Systems10.1145/301227916:2(1-26)Online publication date: 10-Jan-2017
  • (2017)On verifying causal consistencyProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009888(626-638)Online publication date: 1-Jan-2017
  • (2016)Decidability in Parameterized VerificationACM SIGACT News10.1145/2951860.295187347:2(53-64)Online publication date: 3-Jun-2016
  • (2015)Language Representability of Finite P/T NetsEssays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 946510.5555/2963891.2963908(262-282)Online publication date: 1-Aug-2015
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media