Decidability of Weak Simulation on One-Counter Nets

One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for zero. We show that weak simulation preorder is decidable for OCN and that weak simulation approximants do not converge at level ω, but only at ω...

Full description

Saved in:
Bibliographic Details
Published in:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 203 - 212
Main Authors: Hofman, Piotr, Mayr, Richard, Totzke, Patrick
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2013
Subjects:
Automata
Automata theory
Computational modeling
Educational institutions
Games
Model checking
One-counter machines
Radiation detectors
Semantics
ISBN:1479904139, 9781479904136
ISSN:1043-6871
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for zero. We show that weak simulation preorder is decidable for OCN and that weak simulation approximants do not converge at level ω, but only at ω 2 . In contrast, other semantic relations like weak bisimulation are undecidable for OCN [1], and so are weak (and strong) trace inclusion (Sec. VII).
AbstractList One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for zero. We show that weak simulation preorder is decidable for OCN and that weak simulation approximants do not converge at level ω, but only at ω 2 . In contrast, other semantic relations like weak bisimulation are undecidable for OCN [1], and so are weak (and strong) trace inclusion (Sec. VII).
Author Totzke, Patrick
Mayr, Richard
Hofman, Piotr
Author_xml – sequence: 1
  givenname: Piotr
  surname: Hofman
  fullname: Hofman, Piotr
  organization: Univ. of Warsaw, Warsaw, Poland
– sequence: 2
  givenname: Richard
  surname: Mayr
  fullname: Mayr, Richard
  organization: Univ. of Edinburgh, Edinburgh, UK
– sequence: 3
  givenname: Patrick
  surname: Totzke
  fullname: Totzke, Patrick
  organization: Univ. of Edinburgh, Edinburgh, UK
BookMark eNotzM1Kw0AUQOEBK9hUd-7c5AVS753J_C0lai0Eu6jistxk7sBomkiSLvr2CgoHvt3JxKIfehbiFmGNCP6-3lb7tQRUa2kuRIal9R5KVH4hlgilKoyzeCWyafoEAGlKWAr1yG0K1KQuzed8iPkH01e-T8dTR3Ma-vy3Xc9FNZz6mcf8lefpWlxG6ia--Xcl3p-f3qqXot5tttVDXZAscS4aE6UGphBN44i8JeWUtuSiQ6cIJEsPwUQ0AYNqsPXY6mjRoS1bR0GtxN3fNzHz4XtMRxrPB6Mtai3VD1YpREA
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2013.26
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 212
ExternalDocumentID 6571552
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a241t-b6f250eadf6b8aa97a38357a8f8183a02e290d6f16d1d3b1c91c5f718174c8ad3
IEDL.DBID RIE
ISBN 1479904139
9781479904136
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000326815000025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 04:17:06 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a241t-b6f250eadf6b8aa97a38357a8f8183a02e290d6f16d1d3b1c91c5f718174c8ad3
PageCount 10
ParticipantIDs ieee_primary_6571552
PublicationCentury 2000
PublicationDate 2013-June
PublicationDateYYYYMMDD 2013-06-01
PublicationDate_xml – month: 06
  year: 2013
  text: 2013-June
PublicationDecade 2010
PublicationTitle 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev lics
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0001035133
Score 1.9781487
Snippet One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for...
SourceID ieee
SourceType Publisher
StartPage 203
SubjectTerms Automata
Automata theory
Computational modeling
Educational institutions
Games
Model checking
One-counter machines
Radiation detectors
Semantics
Title Decidability of Weak Simulation on One-Counter Nets
URI https://ieeexplore.ieee.org/document/6571552
WOSCitedRecordID wos000326815000025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH5sw4OnqZv4mx48mq1t2qQ5T4eCzMEUdxv58QJD7MbWCf73Jm23efAi9NAGCm3Svi8ved_3AdyKWAvFQ050gjFJeKqItEoRxjhyy6iUSpZmE3w0yqZTMW7A3Y4Lg4hl8Rn2_Gm5l28WeuOXyvos5V4xrAlNzlnF1dqvp_gtMbqPwg7oayUCSpjLCkpSF3ex10VtsdV6qq_ZriJe9J-fBhNf8UV7Xm_hl-NKCTjD9v8e9Qi6e-ZeMN5h0jE0MD-B9ta6Iaj_5A7Qe9RzU2l0fwcLG7yj_Agm88_azStwx0uOxFPW_Y0jLNZdeBs-vA4eSe2fQKTD5YIoZt0Ex30qlqlMSsGlS0dTLjPrUJrKMMZYhIbZiJnIUBVpEenUOrByWYrOpKGn0MoXOZ5BYFKqkMaYZpYmNlICGSYylS4Bio2blJxDx_fBbFlJZMzq17_4u_kSDuPKVYKE0RW0itUGr-FAfxXz9eqmHNcff5Cb9w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGP2CaKInVDD-dgePFti6tesZNRBxkoCRG2m7rwkxDgPDxP_edgzw4MWkh3VJk63d-vq133sP4FYEWije5kSHGJCQR4pIoxRhjCM3jEqpZGE2wZMkHo_FoAJ3Gy4MIhbJZ9h0l8VZfjrTS7dV1mIRd4phO7DrnLNKttZ2R8UditHtPGyhvtQioITZuKCgdXE7-9qmYq32VNbZJidetPq9ztDlfNGmU1z45blSQM5j7X8PewiNLXfPG2xQ6QgqmB1DbW3e4JX_ch3oPeppulLp_vZmxntD-e4Npx-ln5dny0uGxJHWXcME80UDXh8fRp0uKR0UiLTInBPFjF3i2I_FMBVLKbi0AWnEZWwsTlPZDjAQ7ZQZn6V-SpWvha8jY-HKxik6lik9gWo2y_AUvDSiCmmAUWxoaHwlkGEoI2lDoCC1y5IzqLs-mHyuRDIm5euf_337Bva7o-f-pN9Lni7gIFh5TJC2fwnVfL7EK9jTX_l0Mb8uxvgH2k-fQA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2013+28th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Decidability+of+Weak+Simulation+on+One-Counter+Nets&rft.au=Hofman%2C+Piotr&rft.au=Mayr%2C+Richard&rft.au=Totzke%2C+Patrick&rft.date=2013-06-01&rft.pub=IEEE&rft.isbn=9781479904136&rft.issn=1043-6871&rft.spage=203&rft.epage=212&rft_id=info:doi/10.1109%2FLICS.2013.26&rft.externalDocID=6571552
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon