Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Logical Reasoning and Petri Nets

Logical Reasoning and Petri Nets

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 2679/2003
BookApplications and Theory of Petri Nets 2003: 24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003. Proceedings
Copyright2003
Page1021
Subject CollectionComputer Science
SpringerLink DateThursday, February 19, 2004
Add to marked items
Abstract

The main result of the paper states that a set F of propositional-logic formulas is contradictory iff in all net representations of F the empty marking is reproducible.

Fulltext Preview (Small, Large)
Image of the first page of the fulltext
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.108 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)