Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CONCUR
1999
Springer

favoriteEmaildiscussreport

109views Distributed And Parallel Com...» more CONCUR 1999»

An Unfolding Algorithm for Synchronous Products of Transition Systems

13 years 8 months ago

An Unfolding Algorithm for Synchronous Products of Transition Systems

Download www.fmi.uni-stuttgart.de

Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.

Javier Esparza, Stefan Römer

Real-time Traffic

CONCUR 1999 | Distributed And Parallel Computing | Petri Nets | Unfolding Method | Unfolding Procedure |

claim paper

Related Content

» Unfolding Concurrent WellStructured Transition Systems

» Timed Unfoldings for Networks of Timed Automata

» Model Checking Synchronized Products of Infinite Transition Systems

» Factorization Properties of Symbolic Unfoldings of Colored Petri Nets

» Optimising Enabling Tests and Unfoldings of Algebraic System Nets

» Trellis Processes A Compact Representation for Runs of Concurrent Systems

» Unfolding Synthesis of Asynchronous Automata

» Relationships Between Models of Concurrency

» On the Construction of Pullbacks for Safe Petri Nets

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	CONCUR
Authors	Javier Esparza, Stefan Römer

Comments (0)