Results 1 
3 of
3
ModelChecking for a Subclass of Event Structures
 Proc. of TACAS'97, LNCS 1217
, 1997
"... . A finite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building fi ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
(Show Context)
. A finite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building finite representations of event structures in an efficient way by applying partial order reductions is provided. 1 Introduction Model checking is one of the most successful methods of automatic verification of program properties. A modelchecking algorithm decides whether a finitestate concurrent system satisfies its specification, given as a formula of a temporal logic [3, 10]. Behaviour of a concurrent system can be modeled in two ways. In the interleaving semantics, the meaning of a program is an execution tree, temporallogic assertions are interpreted over paths of this tree. In partialorder semantics (or event structure semantics), behaviour is an event structure, where the ordering r...
Regular Trace Event Structures
, 1996
"... We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting.
Extensions of Independence Models
"... The purpose of this progress report is to give an account of the scientific work I have carried out during the Ph.D. part A programme at BRICS 1 , University of Aarhus. The through subject is independence models for concurrency, which are models for distributed reactive systems that besides repres ..."
Abstract
 Add to MetaCart
(Show Context)
The purpose of this progress report is to give an account of the scientific work I have carried out during the Ph.D. part A programme at BRICS 1 , University of Aarhus. The through subject is independence models for concurrency, which are models for distributed reactive systems that besides representing possible temporal orderings are capable of representing the causal ordering of events in the system. A formal comparison using category theory jointly with Vladimiro Sassone, of two concrete independence models is presented, namely the models of transition systems with independence and labelled asynchronous transition systems. These are suitable for giving semantics to CCSlike languages. Then we study an open decidability problem for a particular independence bisimulation; hereditary history preserving bisimulation, categorically identified by a span of open maps, and in particular applicable to the models above. Finally, we consider how to broaden the scope of independence models, c...