Sciweavers

1895 search results - page 178 / 379
» Using ATL for Checking Models
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
15 years 6 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
ENTCS
2007
158views more  ENTCS 2007»
15 years 6 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
FIDJI
2003
Springer
15 years 11 months ago
Model Generation for Distributed Java Programs
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
Rabéa Boulifa, Eric Madelaine
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
15 years 10 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas
ENTCS
2002
125views more  ENTCS 2002»
15 years 6 months ago
Pathway Logic: Executable Models of Biological Networks
In this paper we describe the use of the rewriting logic based Maude tool to model and analyze mammalian signaling pathways. We discuss the representation of the underlying biolog...
Steven Eker, Merrill Knapp, Keith Laderoute, Patri...