default search action
Piotr Chrzastowski-Wachtel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Piotr Chrzastowski-Wachtel, Piotr Ulanowski:
Some Petri Net Problems with Counterintuitive Solutions. PeNGE@Petri Nets 2024
2010 – 2019
- 2019
- [c13]Piotr Chrzastowski-Wachtel, Michal Dolezek, Pawel Greipner, Tomasz Wójcicki:
Petri Meta-Compiler - A Recursive Approach to System Design and Development. PNSE@Petri Nets/ACSD 2019: 109-126 - 2016
- [c12]Piotr Chrzastowski-Wachtel:
Shapes of Concurrency. CS&P 2016: 269-273 - 2015
- [j5]Jacek Sroka, Piotr Chrzastowski-Wachtel, Jan Hidders:
On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality. Fundam. Informaticae 141(4): 367-398 (2015) - 2013
- [c11]Piotr Chrzastowski-Wachtel, Pawel Golab, Bartosz Lewinski:
Sound Recoveries of Structural Workflows with Synchronization. CS&P 2013: 73-87 - 2011
- [c10]Jacek Sroka, Piotr Chrzastowski-Wachtel, Jan Hidders:
On Generating *-Sound Nets with Substitution. ACSD 2011: 3-12 - 2010
- [c9]Piotr Chrzastowski-Wachtel, Jakub Rauch:
IRS-MT: Tool for Intelligent Resource Allocation. ACSD/Petri Nets Workshops 2010: 235-250
2000 – 2009
- 2008
- [j4]Piotr Chrzastowski-Wachtel, Pawel Findeisen, Grzegorz Wolny:
Time Distribution in Structural Workflow Nets. Fundam. Informaticae 85(1-4): 67-87 (2008) - [c8]Michal Adamaszek, Piotr Chrzastowski-Wachtel, Anna Niewiarowska:
VIPER, a Student-Friendly Visual Interpreter of Pascal. ISSEP 2008: 192-203 - 2006
- [j3]Piotr Chrzastowski-Wachtel:
Determining Sound Markings in Structured Nets. Fundam. Informaticae 72(1-3): 65-79 (2006) - 2003
- [c7]Boualem Benatallah, Piotr Chrzastowski-Wachtel, Rachid Hamadi, Milton O'Dell, Adi Susanto:
HiWorD: A Petri Net-Based Hierarchical Workflow Designer. ACSD 2003: 235-236 - [c6]Piotr Chrzastowski-Wachtel, Boualem Benatallah, Rachid Hamadi, Milton O'Dell, Adi Susanto:
A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling. Business Process Management 2003: 336-353 - 2002
- [c5]Piotr Chrzastowski-Wachtel, Jerzy Tyszkiewicz:
A Maple Package for Conditional Event Algebras. WCII 2002: 131-151 - 2001
- [j2]Piotr Chrzastowski-Wachtel, Jerzy Tyszkiewicz, Achim G. Hoffmann, Arthur Ramer:
Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker. Inf. Process. Lett. 79(4): 155-160 (2001)
1990 – 1999
- 1999
- [c4]Piotr Chrzastowski-Wachtel:
Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem. ICATPN 1999: 268-281 - 1996
- [j1]Marek Raczunas, Piotr Chrzastowski-Wachtel:
A Diophantine problem of Frobenius in terms of the least common multiple. Discret. Math. 150(1-3): 347-357 (1996) - 1995
- [c3]Piotr Chrzastowski-Wachtel, Marek Raczunas:
Orbits, half-frozen tokens and the liveness of weighted circuits. STRICT 1995: 116-128 - 1993
- [c2]Piotr Chrzastowski-Wachtel, Marek Raczunas:
Liveness of Weighted Circuits and the Diophantine Problem of Frobenius. FCT 1993: 171-180 - 1992
- [c1]Enrique Teruel, Piotr Chrzastowski-Wachtel, José Manuel Colom, Manuel Silva Suárez:
On Weighted T-Systems. Application and Theory of Petri Nets 1992: 348-367
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-27 17:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint