Peep Küngas  Home/Search
Context
Related
| idi.ntnu.no/~peep/...NWPT2002_Kungas.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: idi.ntnu.no/~peep/articles (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: the sum of complexities of the multiple searches, not their product. Thus abstraction may be an helpful tool for reducing the e ect of the state space explosion problem associated with Petri net reachability checking. While combining abstraction with Petri net reachability checking we take advantage of a fact that Petri nets are representable [1] as sets of Linear Logic [2] (LL) sequents. Thus we can reuse an abstraction framework for LL theorem proving [5], which is adaption from a technique... (Update)
Active bibliography (related documents): More All
0.5: Resource-Conscious AI Planning with Conjunctions and Disjunctions - Küngas (2002) (Correct)
0.2: Transactions and Zero-Safe Nets - Bruni, Montanari (2001) (Correct)
0.2: Executing Transactions in Zero-Safe Nets - Bruni, Montanari (2000) (Correct)
Similar documents based on text: More All
0.4: Symbolic Negotiation with Linear Logic - Küngas, Matskin (2004) (Correct)
0.4: Learning State Machines in the Robot Moving Context - Küngas (2001) (Correct)
0.4: Linear Logic for Domain-Independent AI Planning (Extended Abstract) - Küngas (2003) (Correct)
BibTeX entry: (Update)
@misc{ ngas-abstractionbased,
author = "Peep Küngas",
title = "Abstraction-Based Petri Net Reachability Checking",
url = "citeseer.ist.psu.edu/641951.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987 ACM
368 Analysis and Applications (context) - Murata, Properties - 1989
139 Planning as Search: A Quantitative Approach (context) - Korf - 1987 ACM DBLP
113 Automatically Generating Abstractions for Planning - Knoblock - 1994 ACM DBLP
38 The Reachability Problem Requires Exponential Space (context) - Lipton - 1976
26 Completeness Results for Linear Logic on Petri Nets - Engberg, Winskel - 1997 ACM DBLP
5 A Method for Stepwise Re nement and Abstraction of Petri Net.. (context) - Suzuki, Murata - 1983
2 Linear Logic Theorem Proving with Abstraction (context) - ungas - 2002
1 The Abstraction of Petri net (context) - Song, Satoh et al. - 1987
Documents on the same site (http://www.idi.ntnu.no/~peep/articles.html): More
Symbolic Negotiation with Linear Logic - Küngas, Matskin (2004) (Correct)
Linear Logic for Domain-Independent AI Planning (Extended Abstract) - Küngas (2003) (Correct)
Linear Logic, Partial Deduction and Cooperative Problem Solving - Küngas, Matskin (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC