TU Dresden
/
TU Dresden
/
Informatik
Computer Science
/
ICCL
/
TU Dresden
/
Fakultät Informatik
Faculty of Computer Science
/
International Center For Computational Logic
Account
Log in
Edit tools
Internal
Suche
Search
Deutsch
About ICCL
News & Dates
Profile
Research Groups
People
Job Offers
Location and Contact
Study
Courses
Theses
European Master
International Master
Research
Research Areas
Projects
Publications
Cooperation
Offers
Partners
RDF
Help
Browse wiki
From International Center for Computational Logic
Jump to:
navigation
,
search
This page or action requires JavaScript to work. Please enable JavaScript in your browser or use a browser where it is supported, so that functionality can be provided as requested. For further assistance, please have a look at the
noscript
help page.
On the Complexity of Synthesis of nop-Free Boolean Petri Nets./en/en
Hide groups
Hide incoming properties
Information is currently being retrieved from the backend.
Special pages
Printable version
