A unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) refinements, (2) forward and backward simulations, (3) hybrid forward-backward and backward-forward simulations, and (4) history and prophecy relations are defined. History and prophecy relations are abstract versions of the history and prophecy variables of Abadi and Lamport, as well as the auxiliary variables of Owicki and Gries. Relationships between the different types of simulations, as well as soundness and completeness results, are stated and proved. Finally, it is shown how invariants can be incorporated into all the simulations. Even though many results are ...
This paper presents a framework for distributed simulation that is based on system-theoretic and log...
International audienceWe explore the notion of history-determinism in the context of timed automata ...
When proving the correctness of algorithms in distributed systems, one generally consid-ers safety c...
AbstractA unified, comprehensive presentation of simulation techniques for verification of concurren...
Abstract. A general automaton model for timing-based systems is presented and is used as the context...
AbstractA general automaton model for timing-based systems is presented and is used as the context f...
Abstract. The technique of forward/backward simulations has been applied successfuly in many distrib...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...
We describe an approach to verifying concurrent data structures based on simulation between two Inpu...
AbstractRewriting logic is a flexible and general logic to specify concurrent systems. To prove prop...
In the literature, the conditions on history variables or forward simulations that are related to li...
AbstractWe describe an approach to verifying concurrent data structures based on simulation between ...
Invited contribution at FORMATS'22International audienceTimed automata have been introduced by Rajee...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
In this paper we present a unifying approach for deciding various bisimulations, simulation equiv-al...
This paper presents a framework for distributed simulation that is based on system-theoretic and log...
International audienceWe explore the notion of history-determinism in the context of timed automata ...
When proving the correctness of algorithms in distributed systems, one generally consid-ers safety c...
AbstractA unified, comprehensive presentation of simulation techniques for verification of concurren...
Abstract. A general automaton model for timing-based systems is presented and is used as the context...
AbstractA general automaton model for timing-based systems is presented and is used as the context f...
Abstract. The technique of forward/backward simulations has been applied successfuly in many distrib...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...
We describe an approach to verifying concurrent data structures based on simulation between two Inpu...
AbstractRewriting logic is a flexible and general logic to specify concurrent systems. To prove prop...
In the literature, the conditions on history variables or forward simulations that are related to li...
AbstractWe describe an approach to verifying concurrent data structures based on simulation between ...
Invited contribution at FORMATS'22International audienceTimed automata have been introduced by Rajee...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
In this paper we present a unifying approach for deciding various bisimulations, simulation equiv-al...
This paper presents a framework for distributed simulation that is based on system-theoretic and log...
International audienceWe explore the notion of history-determinism in the context of timed automata ...
When proving the correctness of algorithms in distributed systems, one generally consid-ers safety c...