You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (8)

Journals (0)

1-8 of 8 results for finite complete prefix

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings

Retricted access

Research article

First published 2009-8

Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings

Agnes Madalinski., Eric Fabre

Fundamenta Informaticae

Select article: Taking Complete Finite Prefixes To High Level,Symbolically *

Retricted access

Research article

First published 2024-09-20

Taking Complete Finite Prefixes To High Level,Symbolically *

Nick Würdemann, Thomas Chatain, Stefan Haar [...]

Fundamenta Informaticae

Select article: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

Retricted access

Research article

First published 1999-2

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

Keijo Heljanko

Fundamenta Informaticae

Select article: Reachability in Contextual Nets

Retricted access

Research article

First published 2002-6

Reachability in Contextual Nets

Józef Winkowski

Fundamenta Informaticae

Select article: Unfolding Semantics of Petri Nets Based on Token Flows

Retricted access

Research article

First published 2009-7

Unfolding Semantics of Petri Nets Based on Token Flows

Robin Bergenthum, Sebastian Mauser, Robert Lorenz [...]

Fundamenta Informaticae

Select article: A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION

Retricted access

Research article

First published 1996-5

A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION

Wan Fokkink

Fundamenta Informaticae

Select article: Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT

Retricted access

Research article

First published 2006-4

Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT

Victor Khomenko, Maciej Koutny, Alex Yakovlev

Fundamenta Informaticae

Select article: Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Retricted access

Research article

First published 2004-9

Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Victor Khomenko, Maciej Koutny, Alex Yakovlev

Fundamenta Informaticae

1
10 / page

Article type

Publication date

Subjects

Access