Petri Nets and Semilinear Sets (Extended Abstract)

DOI10.1007/978-3-319-46750-4_2zbMath1482.68157OpenAlexW2522627362MaRDI QIDQ3179388

Hsu-Chun Yen

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46750-4_2

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Nondeterministic right one-way jumping finite automata

Cites Work

• Unnamed Item
• Normal Petri nets
• On the reachability problem for 5-dimensional vector addition systems
• On weak persistency of Petri nets
• Decidable problems on the strong connectivity of Petri net reachability sets
• Commutative grammars: The complexity of uniform word problems
• PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
• Properties of Conflict-Free and Persistent Petri Nets
• Demystifying Reachability in Vector Addition Systems
• Presburger Vector Addition Systems
• Automated Technology for Verification and Analysis

This page was built for publication: Petri Nets and Semilinear Sets (Extended Abstract)