Modal and temporal logics for processes
C Stirling - Logics for concurrency: structure versus automata, 2005 - Springer
We examine modal and temporal logics for processes. In section 1 we introduce concurrent
processes as terms of an algebraic language comprising a few basic operators, as …
processes as terms of an algebraic language comprising a few basic operators, as …
Model checking
EM Clarke - Foundations of Software Technology and Theoretical …, 1997 - Springer
Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …
such as sequential circuit designs and communication protocols. Specifications are …
CADP 2011: a toolbox for the construction and analysis of distributed processes
H Garavel, F Lang, R Mateescu, W Serwe - International Journal on …, 2013 - Springer
CADP (Construction and Analysis of Distributed Processes) is a comprehensive software
toolbox that implements the results of concurrency theory. Started in the mid-1980s, CADP …
toolbox that implements the results of concurrency theory. Started in the mid-1980s, CADP …
Model checking and modular verification
O Grumberg, DE Long - ACM Transactions on Programming Languages …, 1994 - dl.acm.org
We describe a framework for compositional verification of finite-state processes. The
framework is based on two ideas: a subset of the logic CTL for which satisfaction is …
framework is based on two ideas: a subset of the logic CTL for which satisfaction is …
[書籍][B] Finite transition systems: semantics of communicating systems
A Arnold - 1994 - dl.acm.org
Finite transition systems | Guide books skip to main content ACM Digital Library home ACM
home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
Action versus state based logics for transition systems
A temporal logic based on actions rather than on states is presented and interpreted over
labelled transition systems. It is proved that it has essentially the same power as CTL*, a …
labelled transition systems. It is proved that it has essentially the same power as CTL*, a …
Using partial orders to improve automatic verification methods
P Godefroid - … -Aided Verification: 2nd International Conference, CAV' …, 1991 - Springer
In this paper, we present a verification method for concurrent finite-state systems that
attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency …
attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency …
Three logics for branching bisimulation
Three temporal logics are introduced that induce on labeled transition systems the same
identifications as branching bisimulation, a behavioral equivalence that aims at ignoring …
identifications as branching bisimulation, a behavioral equivalence that aims at ignoring …
CADP 2010: A toolbox for the construction and analysis of distributed processes
H Garavel, F Lang, R Mateescu, W Serwe - … on tools and algorithms for the …, 2011 - Springer
Abstract Cadp (Construction and Analysis of Distributed Processes) is a comprehensive
software toolbox that implements the results of concurrency theory. Started in the mid 80s …
software toolbox that implements the results of concurrency theory. Started in the mid 80s …
The concurrency workbench: A semantics-based tool for the verification of concurrent systems
The Concurrency Workbench is an automated tool for analyzing networks of finite-state
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …