An Improvement of McMillan's Unfolding Algorithm

Authors:
Javier Esparza;Stefan Römer;Walter Vogler
Affiliations:
Institut für Informatik, Technische Universität München, Arcisstr. 21, D-80333 München, Germany. esparza@in.tum.de;Institut für Informatik, Technische Universität München, Arcisstr. 21, D-80333 München, Germany. roemer@in.tum.de;Institut für Informatik, Universität Augsburg, Universitätsstr. 14, D-86159 Augsburg, Germany. walter.vogler@informatik.uni-augsburg.de
Venue:
Formal Methods in System Design
Year:
2002

Citing 11
Cited 73

Combinatorics on traces

Combinatorics on traces
Branching processes of Petri nets

Acta Informatica
Executions: a new partial-order semantics of Petri nets

Theoretical Computer Science
Concurrent hardware: the theory and practice of self-timed design

Concurrent hardware: the theory and practice of self-timed design
Model checking using net unfoldings

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
A technique of state space search based on unfolding

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
An Improvement of McMillan's Unfolding Algorithm

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings

Proceedings of the 7th International Conference on Computer Aided Verification
Petri Net Analysis Using Boolean Manipulation

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Calculating Place Capacity for Petri Nets Using Unfoldings

CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design

Parallelisation of the Petri Net Unfolding Algorithm

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Bounded Reachability Checking with Process Semantics

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Towards an Efficient Algorithm for Unfolding Petri Nets

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Probabilistic cluster unfoldings

Fundamenta Informaticae
Control of Safe Ordinary Petri Nets Using Unfolding

Discrete Event Dynamic Systems
Merged processes: a new condensed representation of Petri net behaviour

CONCUR 2005 - Concurrency Theory
Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT

Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Verification of bounded Petri nets using integer programming

Formal Methods in System Design
Functional verification of task partitioning for multiprocessor embedded systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes

Information Processing Letters
Trellis Processes: A Compact Representation for Runs of Concurrent Systems

Discrete Event Dynamic Systems
Faster Unfolding of General Petri Nets Based on Token Flows

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Unfolding Graph Transformation Systems: Theory and Applications to Verification

Concurrency, Graphs and Models
Directed Unfolding of Petri Nets

Transactions on Petri Nets and Other Models of Concurrency I
McMillan's Complete Prefix for Contextual Nets

Transactions on Petri Nets and Other Models of Concurrency I
Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Planning via Petri net unfolding

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings

Fundamenta Informaticae - Application of Concurrency to System Design
Unfolding Semantics of Petri Nets Based on Token Flows

Fundamenta Informaticae - Petri Nets 2008
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Fundamenta Informaticae - Petri Nets 2008
Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques

Fundamenta Informaticae
Causal dataflow analysis for concurrent programs

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Unfolding concurrent well-structured transition systems

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Branching processes of high-level Petri nets

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Behaviour-preserving transition insertions in unfolding prefixes

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Combining decomposition and unfolding for STG synthesis

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Event structure semantics of Orc

WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Diagnosability verification with Petri net unfoldings

International Journal of Knowledge-based and Intelligent Engineering Systems
Structuring acyclic process models

BPM'10 Proceedings of the 8th international conference on Business process management
Supervisory control of time Petri nets using net unfolding

COMPSAC-W'05 Proceedings of the 29th annual international conference on Computer software and applications conference
A false history of true concurrency: from Petri to tools

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
A new type of behaviour-preserving transition insertions in unfolding prefixes

ICGT'10 Proceedings of the 5th international conference on Graph transformations
Efficient automatic resolution of encoding conflicts using STG unfoldings

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Generalised computation of behavioural profiles based on petri-net unfoldings

WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Querying business process models based on semantics

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
An algorithm for direct construction of complete merged processes

PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Construction and SAT-based verification of contextual unfoldings

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Efficient contextual unfolding

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Simplifying mined process models: an approach based on unfoldings

BPM'11 Proceedings of the 9th international conference on Business process management
Processes for adhesive rewriting systems

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Reduced MDP representation of a logistical planning problem using petri-nets

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Towards a petri net semantics for membrane systems

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Complete finite prefixes of symbolic unfoldings of safe time petri nets

ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Structuring acyclic process models

Information Systems
Timed unfoldings for networks of timed automata

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Symbolic unfoldings for networks of timed automata

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
The implementation of mazurkiewicz traces in POEM

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
The sweep-line state space exploration method

Theoretical Computer Science
Unfoldings of bounded hybrid petri nets

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Canonizable partial order generators

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Efficient retrieval of similar workflow models based on behavior

APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Efficient unfolding of contextual Petri nets

Theoretical Computer Science
Unfolding Semantics of Petri Nets Based on Token Flows

Fundamenta Informaticae - Petri Nets 2008
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

Fundamenta Informaticae - Petri Nets 2008
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings

Fundamenta Informaticae - Application of Concurrency to System Design
Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques

Fundamenta Informaticae
Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT

Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Probabilistic Cluster Unfoldings

Fundamenta Informaticae
What topology tells us about diagnosability in partial order semantics

Discrete Event Dynamic Systems
Verification of petri nets with read arcs

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Model based specification, verification, and test generation for a safety fieldbus profile

SAFECOMP'12 Proceedings of the 31st international conference on Computer Safety, Reliability, and Security
Simplifying discovered process models in a controlled manner

Information Systems
Contextual merged processes

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Faster verification of partially ordered runs in petri nets using compact tokenflows

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
QoS-aware management of monotonic service orchestrations

Formal Methods in System Design
Symbolic unfolding of parametric stopwatch Petri nets

Formal Methods in System Design
Querying business process model repositories

World Wide Web
Building Occurrence Nets from Reveals Relations

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finite-state Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial parts that are larger than necessary (exponentially larger in the worst case). We present a refinement of the algorithm which overcomes this problem.