Sciweavers

99 search results - page 19 / 20
» Complete Process Semantics of Petri Nets
Sort
View
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
13 years 11 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
RP
2010
Springer
146views Control Systems» more  RP 2010»
13 years 6 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Towards Model Transformation in Generated Eclipse Editor Plug-Ins
With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated code generation or verifi...
Karsten Ehrig, Claudia Ermel, Stefan Hänsgen
POPL
1990
ACM
13 years 11 months ago
Concurrent Constraint Programming
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
Vijay A. Saraswat, Martin C. Rinard
IEEESCC
2005
IEEE
14 years 1 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull