Sciweavers

EUROMICRO
2000
IEEE
13 years 9 months ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
FSTTCS
2001
Springer
13 years 9 months ago
Properties of Distributed Timed-Arc Petri Nets
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
Mogens Nielsen, Vladimiro Sassone, Jirí Srb...
FOSSACS
2001
Springer
13 years 9 months ago
High-Level Petri Nets as Type Theories in the Join Calculus
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
Maria Grazia Buscemi, Vladimiro Sassone
CONCUR
2001
Springer
13 years 9 months ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba
CONCUR
2001
Springer
13 years 9 months ago
Compositional Modeling of Reactive Systems Using Open Nets
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Rei...
APN
2001
Springer
13 years 9 months ago
''What Is a Petri Net?''
The increasing number of Petri net variants naturally leads to the question whether the term “Petri net” is more than a common name for very different concepts. This contribut...
Jörg Desel, Gabriel Juhás
SOFSEM
2009
Springer
13 years 9 months ago
Partial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
Robert Lorenz, Gabriel Juhás, Sebastian Mau...
ICALP
2010
Springer
13 years 9 months ago
The Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Peter Habermehl, Roland Meyer, Harro Wimmel
APN
2010
Springer
13 years 9 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
MSE
2002
IEEE
122views Hardware» more  MSE 2002»
13 years 9 months ago
Modeling and Analyzing SMIL Documents in SAM
A composite multimedia object has specific timing relationships among the different types of component media. Coordinating the real-time presentation of information and maintaini...
Huiqun Yu, Xudong He, Shu Gao, Yi Deng