Works (7)

Updated: July 5th, 2023 15:59

2006 journal article

A formal methods approach to medical device review

COMPUTER, 39(4), 61-+.

By: R. Jetley n, S. Iyer n & P. Jones *

co-author countries: United States of America πŸ‡ΊπŸ‡Έ
Source: Web Of Science
Added: August 6, 2018

2005 chapter

An approach to unfolding asynchronous communication protocols

In I. J. H. J. Fitzgerald & A. Tarlecki (Eds.), FM 2005: Formal methods: International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005: proceedings (Lecture notes in computer science ; 3582) (Vol. 3582, pp. 334–349). Berlin; New York: Springer.

By: Y. Lei & S. Iyer

Ed(s): I. J. Fitzgerald & A. Tarlecki

Source: NC State University Libraries
Added: August 6, 2018

2005 journal article

Probabilistic temporal logics via the modal mu-calculus

THEORETICAL COMPUTER SCIENCE, 342(2-3), 316–350.

By: R. Cleaveland*, S. Iyer n & M. Narasimha*

co-author countries: United States of America πŸ‡ΊπŸ‡Έ
author keywords: probabilistic transition systems; reactive systems; probabilistic temporal logic; model-checking; Probabilistic bisimulation
Source: Web Of Science
Added: August 6, 2018

2005 journal article

Simulating perfect channels with probabilistic lossy channels

INFORMATION AND COMPUTATION, 197(1-2), 22–40.

By: P. Abdulla *, C. Baier *, S. Iyer n & B. Jonsson*

co-author countries: Germany πŸ‡©πŸ‡ͺ Sweden πŸ‡ΈπŸ‡ͺ United States of America πŸ‡ΊπŸ‡Έ
Source: Web Of Science
Added: August 6, 2018

2004 journal article

SAT-solving the coverability problem for Petri nets

FORMAL METHODS IN SYSTEM DESIGN, 24(1), 25–43.

co-author countries: Sweden πŸ‡ΈπŸ‡ͺ United States of America πŸ‡ΊπŸ‡Έ
author keywords: infinite state systems; Petri nets; coverability; partial-order methods; unfoldings
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Well-abstracted transition systems: application to FIFO automata

INFORMATION AND COMPUTATION, 181(1), 1–31.

By: A. Finkel, S. Iyer* & G. Sutre

author keywords: infinite state systems; abstraction; symbolic representation; acceleration; protocols; FIFO automata; regular expressions; flatness
Source: Web Of Science
Added: August 6, 2018

1999 chapter

Probabilistic temporal logics via the modal mu-calculus

In Foundations of software science and computation structures: Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999: proceedings (Vol. 1578, pp. 288–305). Berlin; New York: Springer.

By: M. Narasimha, R. Cleaveland & P. Iyer

Source: NC State University Libraries
Added: August 6, 2018