Pushdown Processes: Parallel Composition and Model Checking

1994 ◽  
pp. 98-113 ◽  
Author(s):  
Olaf Burkart ◽  
Bernhard Steffen
Keyword(s):  
Model Checking ◽  
Parallel Composition

ACTION MACHINES: A FRAMEWORK FOR ENCODING AND COMPOSING PARTIAL BEHAVIORS

2006 ◽  
Vol 16 (05) ◽  
pp. 705-726 ◽  
Author(s):  
WOLFGANG GRIESKAMP ◽  
NICOLAS KICILLOF ◽  
NIKOLAI TILLMANN
Keyword(s):  
Model Checking ◽  
Composition Operators ◽  
Parallel Composition ◽  
Full Data ◽  
Transition Systems ◽  
Main Application ◽  
Model Based ◽  
Software Models ◽  
Model Based Testing ◽  
Testing Technology

We describe action machines, a framework for encoding and composing partial behavioral descriptions. Action machines encode behavior as a variation of labeled transition systems where the labels are observable activities of the described artifact and the states capture full data models. Labels may also have structure, and both labels and states may be partial with a symbolic representation of the unknown parts. Action machines may stem from software models or programs, and can be composed in a variety of ways to synthesize new behaviors. The composition operators described here include synchronized and interleaving parallel composition, sequential composition, and alternating simulation. We use action machines in analysis processes such as model checking and model-based testing. The current main application is in the area of model-based conformance testing, where our approach addresses practical problems users at Microsoft have in applying model-based testing technology.

scholarly journals COMPUTABLE SEMANTICS FOR CTL* ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS

2011 ◽  
Vol 22 (04) ◽  
pp. 801-821
Author(s):  
PIETER COLLINS ◽  
IVAN S. ZAPREEV
Keyword(s):  
Model Checking ◽  
Discrete Time ◽  
Dynamic Systems ◽  
Parallel Composition ◽  
Computable Model ◽  
Continuous Space ◽  
Büchi Automaton

In this work, we consider Discrete-Time Continuous-Space Dynamic Systems for which we study the computability of the standard semantics of CTL* (CTL, LTL) and provide a variant thereof computable in the sense of Type-2 Theory of Effectivity. In particular, we show how the computable model checking of existentially and universally quantified path formulae of LTL can be reduced to solving, respectively, repeated reachability and persistence problems on a model obtained as a parallel composition of the original one and a non-deterministic Büchi automaton corresponding to the verified LTL formula.

scholarly journals Compositional and Symbolic Model-Checking of Real-Time Systems

1996 ◽  
Vol 3 (59) ◽  
Author(s):  
Kim G. Larsen ◽  
Paul Pettersson ◽  
Wang Yi
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Symbolic Model Checking ◽  
Automatic Verification ◽  
Parallel Composition ◽  
Real Time Systems ◽  
Symbolic Model ◽  
Verification Tools ◽  
State Region ◽  
Time Systems

Efficient automatic model-checking algorithms for<br />real-time systems have been obtained in recent years<br />based on the state-region graph technique of Alur,<br />Courcoubetis and Dill. However, these algorithms are<br />faced with two potential types of explosion arising from<br />parallel composition: explosion in the space of control<br />nodes, and explosion in the region space over clock variables.<br />In this paper we attack these explosion problems by<br />developing and combining compositional and symbolic<br />model-checking techniques. The presented techniques<br />provide the foundation for a new automatic verification<br />tool Uppaal. Experimental results indicate that<br />Uppaal performs time- and space-wise favorably compared<br />with other real-time verification tools.

scholarly journals Dynamic logic of parallel propositional assignments and its applications to planning

2019 ◽  
Author(s):  
Andreas Herzig ◽  
Frédéric Maris ◽  
Julien Vianey
Keyword(s):  
Model Checking ◽  
Dynamic Logic ◽  
Satisfiability Problem ◽  
Parallel Composition ◽  
Conditional Effects

We introduce a dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive. We show PSPACE completeness of both the model checking and the satisfiability problem and apply our logic to sequential and parallel classical planning where actions have conditional effects.

A FORMULA-DRIVEN MODULAR ATTACK ON STATE EXPLOSION

2002 ◽  
Vol 13 (05) ◽  
pp. 719-731
Author(s):  
Nicoletta De Francesco ◽  
Antonella Santone
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
State Space ◽  
Composition Operator ◽  
The State ◽  
Parallel Composition ◽  
State Explosion ◽  
State Explosion Problem ◽  
Parallel Processes ◽  
Compositional Method

A common characteristic of the new distributed systems is the increasing complexity. Useful paradigms to cope with the complexity of systems are modularity and compositionality. In this paper we define a compositional method to attack the state explosion problem in model checking. The method, given a formula to be checked on a system composed of a set of parallel processes, allows syntactically reducing in a modular way the processes, in order to reduce the state space of their composition. The reduction is formula driven and is based on a notion of equivalence between processes, which is a congruence w.r.t. the parallel composition operator.

scholarly journals Compositional Model Checking of Real Time Systems

1995 ◽  
Vol 2 (19) ◽  
Author(s):  
Francois Laroussinie ◽  
Kim G. Larsen
Keyword(s):  
Model Checking ◽  
Timed Automata ◽  
Parallel Composition ◽  
Combinatorial Explosion ◽  
Binary Decision ◽  
Practical Applications ◽  
Compositional Model ◽  
Finite State ◽  
Time Systems ◽  
Combined Technique

A major problem in applying model checking to finite-state systems<br />is the potential combinatorial explosion of the state space arising from<br />parallel composition. Solutions of this problem have been attempted for<br />practical applications using a variety of techniques. Recent work by Andersen<br />[And95] proposes a very promising compositional model checking<br />technique, which has experimentally been shown to improve results obtained<br />using Binary Decision Diagrams.<br />In this paper we make Andersen's technique applicable to systems described<br />by networks of timed automata. We present a quotient construction,<br />which allows timed automata components to be gradually moved from<br />the network expression into the specification. The intermediate specifications<br />are kept small using minimization heuristics suggested by Andersen.<br />The potential of the combined technique is demonstrated using a prototype<br />implemented in CAML.

Sign in / Sign up

Export Citation Format

Share Document