Result 1 to 20 of 42 total
Propositional dynamic logic for message-passing systems. (English)
Log. Methods Comput. Sci. 6, No. 3, Paper No. 16, 31 p., electronic only (2010).
1
Analyzing the impact of protocol changes on tests. (English)
Uyar, M. Ümit (ed.) et al., Testing of communicating systems. 18th IFIP TC6/ WG6.1 international conference, TestCom 2006, New York, NY, USA, May 16‒18, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34184-6/pbk). Lecture Notes in Computer Science 3964, 197-212 (2006).
2
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. (English)
Inf. Comput. 204, No. 6, 920-956 (2006).
3
Quantitative analysis of probabilistic lossy channel systems. (English)
Inf. Comput. 204, No. 5, 713-740 (2006).
4
Verification of programs with half-duplex communication. (English)
Inf. Comput. 202, No. 2, 166-190 (2005).
5
Reachability problems for sequential dynamical systems with threshold functions. (English)
Theor. Comput. Sci. 295, No. 1-3, 41-64 (2003).
6
An enhanced model for testing asynchronous communicating systems. (English)
Wu, Jianping (ed.) et al., Formal methods for protocol engineering and distributed systems. FORTE XII/ PSTV XIX ’99. IFIP TC6 WG6.1 joint international conference on Formal description techniques for distributed systems and communication protocols (FORTE XII) and protocol specification, testing and verification (PSTV XIX). Beijing, China, October 5-8, 1999. Boston: Kluwer Academic Publishers. Int. Fed. Inf. Process., IFIP. 28, 337-356 (1999).
7
On the decidability of correctness problems for a communicating automata net. (Russian)
Tr. Inst. Prikl. Mat. Mekh. 2, 128-135 (1998).
8
A modular methodology to verify communication protocols. (English)
Comput. Commun. 20, No. 12, 1069-1077 (1997).
9
A modular methodology to verify communication protocols. (English)
Comput. Commun. 20, No. 12, 1069-1077 (1997).
10
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method. (English)
IEEE Transactions on Software Engineering 20, No.02, 149-162 (1994).
11
Some complexity results for rings of Petri nets. (English)
Int. J. Found. Comput. Sci. 5, No.3-4, 281-292 (1994).
12
Modeling robust asynchronous communication protocols with finite-state machines. (English)
IEEE Trans. Commun. 41, No.3, 492-500 (1993).
13
Communicating Real-Time State Machines. (English)
IEEE Transactions on Software Engineering 18, No.09, 805-816 (1992).
14
Analysis of a class of communicating finite state machines. (English)
Acta Inf. 29, No.6-7, 499-522 (1992).
15
A unified approach to the deadlock detection problem in networks of communicating finite state machines. (English)
Computer-aided verification, Proc. 2nd Int. Conf., CAV ’90, New Brunswick/NJ (USA), Lect. Notes Comput. Sci. 531, 243-252 (1991).
16
A unified approach to the deadlock detection problem in networks of communicating finite state machines. (English)
Computer-aided verification ’90, Proc. 2nd DIMACS Workshop, New Brunswick/NJ (USA) 1990, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 3, 395-404 (1991).
17
Testing for unboundedness of Fifo channels. (English)
Theoretical aspects of computer science, Proc. 8th Annu. Symp., STACS ’91, Hamburg/Ger. 1991, Lect. Notes Comput. Sci. 480, 322-333 (1991).
18
On Conditions for Defining a Closed Cover to Verify Progress for Communicating Finite State Machines. (English)
IEEE Transactions on Software Engineering 15, No.11, 1491-1494 (1989).
19
Boundedness, hierarchy of fairness, and communication networks with delay. (English)
Int. J. Comput. Math. 26, No.3-4, 161-178 (1989).
20
Result 1 to 20 of 42 total
Start
Contact
Print
General Help
