Pages that link to "Item:Q3719811"
From MaRDI portal
The following pages link to Automatic verification of finite-state concurrent systems using temporal logic specifications (Q3719811):
Displaying 50 items.
- A reduced maximality labeled transition system generation for recursive Petri nets (Q903505) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems (Q916414) (← links)
- Reasoning about networks with many identical finite state processes (Q921983) (← links)
- Specification of communicating processes: temporal logic versus refusals-based refinement (Q931435) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Combining partial-order reductions with on-the-fly model-checking. (Q960506) (← links)
- Alternating-time stream logic for multi-agent systems (Q967523) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Assisting the design of a groupware system - Model checking usability aspects of thinkteam (Q1014561) (← links)
- Partitioned PLTL model-checking for refined transition systems (Q1023285) (← links)
- Reasoning about temporal properties of rational play (Q1028639) (← links)
- Verifying time, memory and communication bounds in systems of reasoning agents (Q1036066) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← links)
- Hierarchical verification of asynchronous circuits using temporal logic (Q1070998) (← links)
- On the analysis of cooperation and antagonism in networks of communicating processes (Q1098279) (← links)
- Recognizing safety and liveness (Q1100884) (← links)
- A linear algorithm to solve fixed-point equations on transition systems (Q1115196) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- Programming in temporal-nonmonotonic reasoning (Q1181723) (← links)
- Adequacy-preserving transformations of COSY path programs (Q1185020) (← links)
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings (Q1188590) (← links)
- A model checker for linear time temporal logic (Q1192606) (← links)
- Symbolic model checking: \(10^{20}\) states and beyond (Q1193587) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- A verification system for concurrent programs based on the Boyer-Moore prover (Q1203115) (← links)
- Verifying automata specification of distributed probabilistic real-time systems (Q1273079) (← links)
- Information system design of manufacturing environments (Q1288427) (← links)
- The sh-verification tool -- abstraction-based verification of co-operating systems (Q1295873) (← links)
- A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol (Q1318283) (← links)
- A theory of timed automata (Q1322162) (← links)
- An experience in proving regular networks of processes by modular model checking (Q1323369) (← links)
- Model checking for action-based logics (Q1326587) (← links)
- A logical query language for hypermedia systems (Q1328531) (← links)
- Assisting requirement formalization by means of natural language translation (Q1329090) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- A logic for reasoning about time and reliability (Q1343864) (← links)
- Property preserving abstractions for the verification of concurrent systems (Q1346649) (← links)
- Using integer programming to verify general safety and liveness properties (Q1346653) (← links)
- Model-checking discrete duration calculus (Q1346770) (← links)
- Synchronization trees (Q1348524) (← links)
- A rewriting approach to binary decision diagrams (Q1349250) (← links)
- Petri nets for the design and operation of manufacturing systems (Q1375146) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- A temporal logic for real-time partial ordering with named transactions (Q1391307) (← links)
- Automatic generation of invariants and intermediate assertions (Q1391929) (← links)
- Model-checking large structured Markov chains. (Q1400291) (← links)
