215 search results - page 2 / 43 » Algebraic simulations |
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
ENTCS
2008
13 years 5 months ago
2008
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
JLP
2010
13 years 3 months ago
2010
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...
WADT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...