Statecharts: A visual formalism for complex systems
Science of Computer Programming
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Algebraic theory of processes
The existence of refinement mappings
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
On the power of bounded concurrency II: pushdown automata
Journal of the ACM (JACM)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about infinite computations
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Complexity of equivalence problems for concurrent systems of finite agents
Information and Computation
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Thesis for Bounded Concurrency
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Equivalences for Fair Kripke Structures
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Verification of Fair Transition Systems
Verification of Fair Transition Systems
On Object Systems and Behavioral Inheritance
IEEE Transactions on Software Engineering
PSPACE-completeness of Modular Supervisory Control Problems
Discrete Event Dynamic Systems
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences
Statecharts in the making: a personal account
Proceedings of the third ACM SIGPLAN conference on History of programming languages
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
A Rice-style theorem for parallel automata
Information and Computation
Computational aspects of analyzing social network dynamics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science
Improved model checking of hierarchical systems
Information and Computation
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
The complexity of live sequence charts
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Strategy composition in compositional games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Under-Approximating cut sets for reachability in large scale automata networks
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Under-approximation of Reachability in Multivalued Asynchronous Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.01 |
In implementation verification , We check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the sequential case. Thus, as in the model-checking verification methodology, the state-explosion problem cannot be avoided.