#### Filter Results:

- Full text PDF available (168)

#### Publication Year

1983

2017

- This year (11)
- Last 5 years (43)
- Last 10 years (83)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Paris C. Kanellakis, Scott A. Smolka
- Inf. Comput.
- 1983

We examine the computational complexity of testing finite state processes for equivalence, in the Calculus of Communicating Systems (CCS). This equivalence problem in CCS is presented as a refinement of the familiar problem of testing whether two nondeterministic finite state automata (n.f.s.a.) accept the same language. Three notions of equivalence,… (More)

- Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen
- Inf. Comput.
- 1990

12a. DISTRIBUTION / AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE 13. ABSTRACT (Maximum 200 words) We introduce three models of probabilistic processes, namely, reactive, generative and stratified. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a… (More)

We extend Milner's SCCS to obtain a calculus, PCCS, for reasoning about communicating probabilistic processes. In particular, the nondeterministic process summation operator of SCCS is replaced with a probabilistic one, in which the probability of behaving like a particular summand is given explicitly. The operational semantics for PCCS is based on the… (More)

- Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
- Inf. Comput.
- 1995

- Radu Grosu, Scott A. Smolka
- TACAS
- 2005

We present MC, what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property specified in temporal logic holds of a system specification. Given a specification S of a finite-state system, an LTL (Linear Temporal Logic) formula φ, and parameters and δ, MC takes… (More)

We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200… (More)

We introduce three models of probabilistic processes, namely, reactive, generative and strati ed. These models are investigated within the context of PCCS, an extension of Milner's SCCS in which each summand of a process summation expression is guarded by a probability and the sum of these probabilities is 1. For each model we present a structural… (More)

- Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark
- Theor. Comput. Sci.
- 1994

We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchronous probabilistic systems. Our new model, called probabilistic I/O automata, preserves the fundamental properties of the I/O automaton model, such as the asymmetric treatment of… (More)

- Chi-Chang Jou, Scott A. Smolka
- CONCUR
- 1990

- Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
- COORDINATION
- 2008

We present the ω-calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The ω-calculus naturally captures essential characteristics of MANETs, including the ability of a MANET node to broadcast a message to any other node within its physical transmission range (and no others), and… (More)