---
_id: '4599'
abstract:
- lang: eng
text: 'State-space explosion is a fundamental obstacle in the formal verification
of designs and protocols. Several techniques for combating this problem have emerged
in the past few years, among which two are significant: partial-order reduction
and symbolic state-space search. In asynchronous systems, interleavings of independent
concurrent events are equivalent, and only a representative interleaving needs
to be explored to verify local properties. Partial-order methods exploit this
redundancy and visit only a subset of the reachable states. Symbolic techniques,
on the other hand, capture the transition relation of a system and the set of
reachable states as boolean functions. In many cases, these functions can be represented
compactly using binary decision diagrams (BDDs). Traditionally, the two techniques
have been practiced by two different schools—partial-order methods with enumerative
depth-first search for the analysis of asynchronous network protocols, and symbolic
breadth-first search for the analysis of synchronous hardware designs. We combine
both approaches and develop a method for using partial-order reduction techniques
in symbolic BDD-based invariant checking. We present theoretical results to prove
the correctness of the method, and experimental results to demonstrate its efficacy.'
acknowledgement: Gerard Holzmann provided us with information on SPIN. Ken McMillan
and Doron Peled contributed through discussions. The VIS group at UC Berkeley and
Rajeev Ranjan in particular helped with the experiments.
article_processing_charge: No
article_type: original
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Robert
full_name: Brayton, Robert
last_name: Brayton
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction
in symbolic state-space exploration. Formal Methods in System Design. 2001;18(2):97-116.
doi:10.1023/A:1008767206905
apa: Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (2001).
Partial-order reduction in symbolic state-space exploration. Formal Methods
in System Design. Springer. https://doi.org/10.1023/A:1008767206905
chicago: Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram
Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration.” Formal
Methods in System Design. Springer, 2001. https://doi.org/10.1023/A:1008767206905.
ieee: R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order
reduction in symbolic state-space exploration,” Formal Methods in System Design,
vol. 18, no. 2. Springer, pp. 97–116, 2001.
ista: Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 2001. Partial-order
reduction in symbolic state-space exploration. Formal Methods in System Design.
18(2), 97–116.
mla: Alur, Rajeev, et al. “Partial-Order Reduction in Symbolic State-Space Exploration.”
Formal Methods in System Design, vol. 18, no. 2, Springer, 2001, pp. 97–116,
doi:10.1023/A:1008767206905.
short: R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, Formal Methods
in System Design 18 (2001) 97–116.
date_created: 2018-12-11T12:09:41Z
date_published: 2001-03-01T00:00:00Z
date_updated: 2023-05-08T12:22:38Z
day: '01'
doi: 10.1023/A:1008767206905
extern: '1'
intvolume: ' 18'
issue: '2'
language:
- iso: eng
month: '03'
oa_version: None
page: 97 - 116
publication: Formal Methods in System Design
publication_identifier:
issn:
- 0925-9856
publication_status: published
publisher: Springer
publist_id: '108'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial-order reduction in symbolic state-space exploration
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 18
year: '2001'
...
---
_id: '4600'
abstract:
- lang: eng
text: 'Model checking is a practical tool for automated debugging of embedded software.
In model checking, a high-level description of a system is compared against a
logical correctness requirement to discover inconsistencies. Since model checking
is based on exhaustive state-space exploration and the size of the state space
of a design grows exponentially with the size of the description, scalability
remains a challenge. We have thus developed techniques for exploiting modular
design structure during model checking, and the model checker jMocha (Java MOdel-CHecking
Algorithm) is based on this theme. Instead of manipulating unstructured state-transition
graphs, it supports the hierarchical modeling framework of reactive modules. jMocha
is a growing interactive software environment for specification, simulation and
verification, and is intended as a vehicle for the development of new verification
algorithms and approaches. It is written in Java and uses native C-code BDD libraries
from VIS. jMocha offers: (1) a GUI that looks familiar to Windows/Java users;
(2) a simulator that displays traces in a message sequence chart fashion; (3)
requirements verification both by symbolic and enumerative model checking; (4)
implementation verification by checking trace containment; (5) a proof manager
that aids compositional and assume-guarantee reasoning; and (6) SLANG (Scripting
LANGuage) for the rapid and structured development of new verification algorithms.
jMocha is available publicly at ; it is a successor and extension of the original
Mocha tool that was entirely written in C.'
acknowledgement: 'We thank Himyanshu Anand, Ben Horowitz, Franjo Ivancic, Michael
McDougall, Marius Minea, Oliver Moeller. Shaz Qadeer, Sriram Rajamani, and Jean-Francois
Raskin for their assistance in the development of JMOCHA. The MOCHA project is funded
in part by the DARPA grant NAG2-1214, the NSF CAREER awards CCR95-01708 and CCR97-34115,
the NSF grant CCR99-70925, the NSF ITR grant CCR0085949, the MARC0 grant 98-DT-660,
and the SRC contracts 99-TJ-683.003 and 99-TJ-688. '
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Myong
full_name: Kang, Myong
last_name: Kang
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Freddy
full_name: Mang, Freddy
last_name: Mang
- first_name: Bow
full_name: Wang, Bow
last_name: Wang
citation:
ama: 'Alur R, De Alfaro L, Grosu R, et al. jMocha: A model-checking tool that exploits
design structure. In: Proceedings of the 23rd International Conference on Software
Engineering. IEEE; 2001:835-836. doi:10.1109/ICSE.2001.919196'
apa: 'Alur, R., De Alfaro, L., Grosu, R., Henzinger, T. A., Kang, M., Kirsch, C.,
… Wang, B. (2001). jMocha: A model-checking tool that exploits design structure.
In Proceedings of the 23rd International Conference on Software Engineering
(pp. 835–836). IEEE. https://doi.org/10.1109/ICSE.2001.919196'
chicago: 'Alur, Rajeev, Luca De Alfaro, Radu Grosu, Thomas A Henzinger, Myong Kang,
Christoph Kirsch, Ritankar Majumdar, Freddy Mang, and Bow Wang. “JMocha: A Model-Checking
Tool That Exploits Design Structure.” In Proceedings of the 23rd International
Conference on Software Engineering, 835–36. IEEE, 2001. https://doi.org/10.1109/ICSE.2001.919196.'
ieee: 'R. Alur et al., “jMocha: A model-checking tool that exploits design
structure,” in Proceedings of the 23rd International Conference on Software
Engineering, 2001, pp. 835–836.'
ista: 'Alur R, De Alfaro L, Grosu R, Henzinger TA, Kang M, Kirsch C, Majumdar R,
Mang F, Wang B. 2001. jMocha: A model-checking tool that exploits design structure.
Proceedings of the 23rd International Conference on Software Engineering. ICSE:
Software Engineering, 835–836.'
mla: 'Alur, Rajeev, et al. “JMocha: A Model-Checking Tool That Exploits Design Structure.”
Proceedings of the 23rd International Conference on Software Engineering,
IEEE, 2001, pp. 835–36, doi:10.1109/ICSE.2001.919196.'
short: R. Alur, L. De Alfaro, R. Grosu, T.A. Henzinger, M. Kang, C. Kirsch, R. Majumdar,
F. Mang, B. Wang, in:, Proceedings of the 23rd International Conference on Software
Engineering, IEEE, 2001, pp. 835–836.
conference:
name: 'ICSE: Software Engineering'
date_created: 2018-12-11T12:09:41Z
date_published: 2001-08-07T00:00:00Z
date_updated: 2023-05-08T14:06:55Z
day: '07'
doi: 10.1109/ICSE.2001.919196
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 835 - 836
publication: Proceedings of the 23rd International Conference on Software Engineering
publication_identifier:
isbn:
- '0769510507'
publication_status: published
publisher: IEEE
publist_id: '109'
quality_controlled: '1'
status: public
title: 'jMocha: A model-checking tool that exploits design structure'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '4622'
abstract:
- lang: eng
text: Conventional type systems specify interfaces in terms of values and domains.
We present a light-weight formalism that captures the temporal aspects of software
component interfaces. Specifically, we use an automata-based language to capture
both input assumptions about the order in which the methods of a component are
called, and output guarantees about the order in which the component calls external
methods. The formalism supports automatic compatability checks between interface
models, and thus constitutes a type system for component interaction. Unlike traditional
uses of automata, our formalism is based on an optimistic approach to composition,
and on an alternating approach to design refinement. According to the optimistic
approach, two components are compatible if there is some environment that can
make them work together. According to the alternating approach, one interface
refines another if it has weaker input assumptions, and stronger output guarantees.
We show that these notions have game-theoretic foundations that lead to efficient
algorithms for checking compatibility and refinement.
acknowledgement: We thank Edward A. Lee, Xiaojun Liu, Freddy Mang, and Yuhong Xiong
for fruitful discussions. This research was supported in part by the AFOSR MURI
grant F49620-00-1-0327, the DARPA MoBIES grant F33615-00-C-1703, the MARCO GSRC
grant 98-DT-660, the NSF Theory grant CCR-9988172, and the NSF ITR grant CCR-0085949.
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'De Alfaro L, Henzinger TA. Interface automata. In: Proceedings of the 8th
European Software Engineering Conference. ACM; 2001:109-120. doi:10.1145/503209.503226'
apa: 'De Alfaro, L., & Henzinger, T. A. (2001). Interface automata. In Proceedings
of the 8th European software engineering conference (pp. 109–120). Vienna,
Austria: ACM. https://doi.org/10.1145/503209.503226'
chicago: De Alfaro, Luca, and Thomas A Henzinger. “Interface Automata.” In Proceedings
of the 8th European Software Engineering Conference, 109–20. ACM, 2001. https://doi.org/10.1145/503209.503226.
ieee: L. De Alfaro and T. A. Henzinger, “Interface automata,” in Proceedings
of the 8th European software engineering conference, Vienna, Austria, 2001,
pp. 109–120.
ista: 'De Alfaro L, Henzinger TA. 2001. Interface automata. Proceedings of the 8th
European software engineering conference. FSE: Foundations of Software Engineering,
109–120.'
mla: De Alfaro, Luca, and Thomas A. Henzinger. “Interface Automata.” Proceedings
of the 8th European Software Engineering Conference, ACM, 2001, pp. 109–20,
doi:10.1145/503209.503226.
short: L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 8th European Software
Engineering Conference, ACM, 2001, pp. 109–120.
conference:
end_date: 2001-09-14
location: Vienna, Austria
name: 'FSE: Foundations of Software Engineering'
start_date: 2001-09-10
date_created: 2018-12-11T12:09:48Z
date_published: 2001-06-01T00:00:00Z
date_updated: 2023-05-08T12:01:02Z
day: '01'
doi: 10.1145/503209.503226
extern: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: 109 - 120
publication: Proceedings of the 8th European software engineering conference
publication_identifier:
isbn:
- '9781581133905'
publication_status: published
publisher: ACM
publist_id: '83'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interface automata
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '4623'
abstract:
- lang: eng
text: We classify component-based models of computation into component models and
interface models. A component model specifies for each component howthe component
behaves in an arbitrary environment; an interface model specifies for each component
what the component expects from the environment. Component models support compositional
abstraction, and therefore component-based verification. Interface models support
compositional refinement, and therefore componentbased design. Many aspects of
interface models, such as compatibility and refinement checking between interfaces,
are properly viewed in a gametheoretic setting, where the input and output values
of an interface are chosen by different players.
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
the DARPA ITO grant F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF ITR
grant CCR-0085949.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'De Alfaro L, Henzinger TA. Interface theories for component-based design.
In: Proceedings of the 1st International Workshop on Embedded Software.
Vol 2211. ACM; 2001:148-165. doi:10.1007/3-540-45449-7_11'
apa: 'De Alfaro, L., & Henzinger, T. A. (2001). Interface theories for component-based
design. In Proceedings of the 1st International Workshop on Embedded Software
(Vol. 2211, pp. 148–165). Tahoe City, CA, USA: ACM. https://doi.org/10.1007/3-540-45449-7_11'
chicago: De Alfaro, Luca, and Thomas A Henzinger. “Interface Theories for Component-Based
Design.” In Proceedings of the 1st International Workshop on Embedded Software,
2211:148–65. ACM, 2001. https://doi.org/10.1007/3-540-45449-7_11.
ieee: L. De Alfaro and T. A. Henzinger, “Interface theories for component-based
design,” in Proceedings of the 1st International Workshop on Embedded Software,
Tahoe City, CA, USA, 2001, vol. 2211, pp. 148–165.
ista: 'De Alfaro L, Henzinger TA. 2001. Interface theories for component-based design.
Proceedings of the 1st International Workshop on Embedded Software. EMSOFT: Embedded
Software , LNCS, vol. 2211, 148–165.'
mla: De Alfaro, Luca, and Thomas A. Henzinger. “Interface Theories for Component-Based
Design.” Proceedings of the 1st International Workshop on Embedded Software,
vol. 2211, ACM, 2001, pp. 148–65, doi:10.1007/3-540-45449-7_11.
short: L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 1st International Workshop
on Embedded Software, ACM, 2001, pp. 148–165.
conference:
end_date: 2001-10-10
location: Tahoe City, CA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2001-10-08
date_created: 2018-12-11T12:09:48Z
date_published: 2001-09-26T00:00:00Z
date_updated: 2023-05-08T12:11:20Z
day: '26'
doi: 10.1007/3-540-45449-7_11
extern: '1'
intvolume: ' 2211'
language:
- iso: eng
month: '09'
oa_version: None
page: 148 - 165
publication: Proceedings of the 1st International Workshop on Embedded Software
publication_identifier:
isbn:
- '9783540426738'
publication_status: published
publisher: ACM
publist_id: '84'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interface theories for component-based design
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2211
year: '2001'
...
---
_id: '4632'
abstract:
- lang: eng
text: We present a compositional trace-based model for probabilistic systems. The
behavior of a system with probabilistic choice is a stochastic process, namely,
a probability distribution on traces, or “bundle.” Consequently, the semantics
of a system with both nondeterministic and probabilistic choice is a set of bundles.
The bundles of a composite system can be obtained by combining the bundles of
the components in a simple mathematical way. Refinement between systems is bundle
containment. We achieve assume-guarantee compositionality for bundle semantics
by introducing two scoping mechanisms. The first mechanism, which is standard
in compositional modeling, distinguishes inputs from outputs and hidden state.
The second mechanism, which arises in probabilistic systems, partitions the state
into probabilistically independent regions.
acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003,
the AFOSR MURI grant F49620-00-1-0327, the MARCO GSRC grant 98-DT-660, the NSF Theory
grant CCR-9988172, and the DARPA SEC grant F33615-C-98-3614.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
citation:
ama: 'De Alfaro L, Henzinger TA, Jhala R. Compositional methods for probabilistic
systems. In: Proceedings of the 12th International Conference on on Concurrency
Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:351-365.
doi:10.1007/3-540-44685-0_24'
apa: 'De Alfaro, L., Henzinger, T. A., & Jhala, R. (2001). Compositional methods
for probabilistic systems. In Proceedings of the 12th International Conference
on on Concurrency Theory (Vol. 2154, pp. 351–365). Aalborg, Denmark: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_24'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ranjit Jhala. “Compositional Methods
for Probabilistic Systems.” In Proceedings of the 12th International Conference
on on Concurrency Theory, 2154:351–65. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_24.
ieee: L. De Alfaro, T. A. Henzinger, and R. Jhala, “Compositional methods for probabilistic
systems,” in Proceedings of the 12th International Conference on on Concurrency
Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 351–365.
ista: 'De Alfaro L, Henzinger TA, Jhala R. 2001. Compositional methods for probabilistic
systems. Proceedings of the 12th International Conference on on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 2154, 351–365.'
mla: De Alfaro, Luca, et al. “Compositional Methods for Probabilistic Systems.”
Proceedings of the 12th International Conference on on Concurrency Theory,
vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–65,
doi:10.1007/3-540-44685-0_24.
short: L. De Alfaro, T.A. Henzinger, R. Jhala, in:, Proceedings of the 12th International
Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001, pp. 351–365.
conference:
end_date: 2001-08-25
location: Aalborg, Denmark
name: 'CONCUR: Concurrency Theory'
start_date: 2001-08-20
date_created: 2018-12-11T12:09:51Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T10:24:59Z
day: '13'
doi: 10.1007/3-540-44685-0_24
extern: '1'
intvolume: ' 2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 351 - 365
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
isbn:
- '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '75'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Compositional methods for probabilistic systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4633'
abstract:
- lang: eng
text: "A procedure for the analysis of state spaces is called symbolic if it manipulates
not individual states, but sets of states that are represented by constraints.
Such a procedure can be used for the analysis of infinite state spaces, provided
termination is guaranteed. We present symbolic procedures, and corresponding termination
criteria, for the solution of infinite-state games, which occur in the control
and modular verification of infinite-state systems. To characterize the termination
of symbolic procedures for solving infinite-state games, we classify these game
structures into four increasingly restrictive categories:\r\n1 \tClass 1 consists
of infinite-state structures for which all safety and reachability games can be
solved.\r\n2 \tClass 2 consists of infinite-state structures for which all ω-regular
games can be solved.\r\n3 \tClass 3 consists of infinite-state structures for
which all nested positive boolean combinations of ω-regular games can be solved.\r\n4
\ \tClass 4 consists of infinite-state structures for which all nested boolean
combinations of ω-regular games can be solved.\r\nWe give a structural characterization
for each class, using equivalence relations on the state spaces of games which
range from game versions of trace equivalence to a game version of bisimilarity.
We provide infinite-state examples for all four classes of games from control
problems for hybrid systems. We conclude by presenting symbolic algorithms for
the synthesis of winning strategies (“controller synthesis”) for infinitestate
games with arbitrary ω-regular objectives, and prove termination over all class-2
structures. This settles, in particular, the symbolic controller synthesis problem
for rectangular hybrid systems."
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the NSF Theory
grant CCR-9988172, and the NSF ITR grant CCR-0085949.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'De Alfaro L, Henzinger TA, Majumdar R. Symbolic algorithms for infinite-state
games. In: Proceedings of the 12th International Conference on on Concurrency
Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:536-550.
doi:10.1007/3-540-44685-0_36'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2001). Symbolic algorithms
for infinite-state games. In Proceedings of the 12th International Conference
on on Concurrency Theory (Vol. 2154, pp. 536–550). Aalborg, Denmark: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_36'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Symbolic Algorithms
for Infinite-State Games.” In Proceedings of the 12th International Conference
on on Concurrency Theory, 2154:536–50. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_36.
ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Symbolic algorithms for infinite-state
games,” in Proceedings of the 12th International Conference on on Concurrency
Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 536–550.
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. Symbolic algorithms for infinite-state
games. Proceedings of the 12th International Conference on on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 2154, 536–550.'
mla: De Alfaro, Luca, et al. “Symbolic Algorithms for Infinite-State Games.” Proceedings
of the 12th International Conference on on Concurrency Theory, vol. 2154,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 536–50, doi:10.1007/3-540-44685-0_36.
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 12th International
Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001, pp. 536–550.
conference:
end_date: 2001-08-25
location: Aalborg, Denmark
name: 'CONCUR: Concurrency Theory'
start_date: 2001-08-20
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T09:57:31Z
day: '13'
doi: 10.1007/3-540-44685-0_36
extern: '1'
intvolume: ' 2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 536 - 550
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
isbn:
- '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '73'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic algorithms for infinite-state games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4634'
abstract:
- lang: eng
text: "A controller is an environment for a system that achieves a particular control
objective by providing inputs to the system without constraining the choices of
the system. For synchronous systems, where system and controller make simultaneous
and interdependent choices, the notion that a controller must not constrain the
choices of the system can be formalized by type systems for composability. In
a previous paper, we solved the control problem for static and dynamic types:
a static type is a dependency relation between inputs and outputs, and composition
is well-typed if it does not introduce cyclic dependencies; a dynamic type is
a set of static types, one for each state. Static and dynamic types, however,
cannot capture many important digital circuits, such as gated clocks, bidirectional
buses, and random-access memory. We therefore introduce more general type systems,
so-called dependent and bidirectional types, for modeling these situations, and
we solve the corresponding control problems.\r\nIn a system with a dependent type,
the dependencies between inputs and outputs are determined gradually through a
game of the system against the controller. In a system with a bidirectional type,
also the distinction between inputs and outputs is resolved dynamically by such
a game. The game proceeds in several rounds. In each round the system and the
controller choose to update some variables dependent on variables that have already
been updated. The solution of the control problem for dependent and bidirectional
types is based on algorithms for solving these games."
acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003,
the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the AFOSR
MURI grant F49620-00-1-0327, and the NSF Theory grant CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: 'De Alfaro L, Henzinger TA, Mang F. The control of synchronous systems, Part
II. In: Proceedings of the 12th International Conference on on Concurrency
Theory. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:566-581.
doi:10.1007/3-540-44685-0_38'
apa: 'De Alfaro, L., Henzinger, T. A., & Mang, F. (2001). The control of synchronous
systems, Part II. In Proceedings of the 12th International Conference on on
Concurrency Theory (Vol. 2154, pp. 566–581). Aalborg, Denmark: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_38'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous
Systems, Part II.” In Proceedings of the 12th International Conference on on
Concurrency Theory, 2154:566–81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001. https://doi.org/10.1007/3-540-44685-0_38.
ieee: L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems,
Part II,” in Proceedings of the 12th International Conference on on Concurrency
Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 566–581.
ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. The control of synchronous systems,
Part II. Proceedings of the 12th International Conference on on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 2154, 566–581.'
mla: De Alfaro, Luca, et al. “The Control of Synchronous Systems, Part II.” Proceedings
of the 12th International Conference on on Concurrency Theory, vol. 2154,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–81, doi:10.1007/3-540-44685-0_38.
short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International
Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2001, pp. 566–581.
conference:
end_date: 2001-08-25
location: Aalborg, Denmark
name: 'CONCUR: Concurrency Theory'
start_date: 2001-08-20
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T10:20:19Z
day: '13'
doi: 10.1007/3-540-44685-0_38
extern: '1'
intvolume: ' 2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 566 - 581
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
isbn:
- '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '74'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The control of synchronous systems, Part II
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4635'
abstract:
- lang: eng
text: We show how model checking techniques can be applied to the analysis of connectivity
and cost-of-traversal properties of Web sites.
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: 'De Alfaro L, Henzinger TA, Mang F. MCWEB: A model-checking tool for web-site
debugging. In: Proceedings of the 10th International Conference on World Wide
Web. ACM; 2001:86-87.'
apa: 'De Alfaro, L., Henzinger, T. A., & Mang, F. (2001). MCWEB: A model-checking
tool for web-site debugging. In Proceedings of the 10th international conference
on World Wide Web (pp. 86–87). Hong Kong, Hong Kong: ACM.'
chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “MCWEB: A Model-Checking
Tool for Web-Site Debugging.” In Proceedings of the 10th International Conference
on World Wide Web, 86–87. ACM, 2001.'
ieee: 'L. De Alfaro, T. A. Henzinger, and F. Mang, “MCWEB: A model-checking tool
for web-site debugging,” in Proceedings of the 10th international conference
on World Wide Web, Hong Kong, Hong Kong, 2001, pp. 86–87.'
ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. MCWEB: A model-checking tool for
web-site debugging. Proceedings of the 10th international conference on World
Wide Web. WWW: World Wide Web Conference, 86–87.'
mla: 'De Alfaro, Luca, et al. “MCWEB: A Model-Checking Tool for Web-Site Debugging.”
Proceedings of the 10th International Conference on World Wide Web, ACM,
2001, pp. 86–87.'
short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International
Conference on World Wide Web, ACM, 2001, pp. 86–87.
conference:
end_date: 2000-05-05
location: Hong Kong, Hong Kong
name: 'WWW: World Wide Web Conference'
start_date: 2001-05-01
date_created: 2018-12-11T12:09:52Z
date_published: 2001-05-01T00:00:00Z
date_updated: 2023-05-08T09:39:02Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ir.webis.de/anthology/2001.wwwconf_conference-2001p.57/
month: '05'
oa_version: None
page: 86 - 87
publication: Proceedings of the 10th international conference on World Wide Web
publication_identifier:
isbn:
- '9781581133486'
publication_status: published
publisher: ACM
publist_id: '71'
quality_controlled: '1'
status: public
title: 'MCWEB: A model-checking tool for web-site debugging'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '4636'
abstract:
- lang: eng
text: 'Abstract. Dynamic programs, or fixpoint iteration schemes, are useful for
solving many problems on state spaces, including model checking on Kripke structures
(“verification”), computing shortest paths on weighted graphs (“optimization”),
computing the value of games played on game graphs (“control”). For Kripke structures,
a rich fixpoint theory is available in the form of the µ-calculus. Yet few connections
have been made between different interpretations of fixpoint algorithms. We study
the question of when a particular fixpoint iteration scheme ϕ for verifying an
ω-regular property Ψ on a Kripke structure can be used also for solving a two-player
game on a game graph with winning objective Ψ. We provide a sufficient and necessary
criterion for the answer to be affirmative in the form of an extremal-model theorem
for games: under a game interpretation, the dynamic program ϕ solves the game
with objective Ψ if and only if both (1) under an existential interpretation on
Kripke structures, ϕ is equivalent to ∃Ψ, and (2) under a universal interpretation
on Kripke structures, ϕ is equivalent to ∀Ψ. In other words, ϕ is correct on all
two-player game graphs iff it is correct on all extremal game graphs, where one
or the other player has no choice of moves. The theorem generalizes to quantitative
interpretations, where it connects two-player games with costs to weighted graphs.
While the standard translations from ω-regular properties to the µ-calculus violate
(1) or (2), we give a translation that satisfies both conditions. Our construction,
therefore, yields fixpoint iteration schemes that can be uniformly applied on
Kripke structures, weighted graphs, game graphs, and game graphs with costs, in
order to meet or optimize a given ω-regular objective.'
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'De Alfaro L, Henzinger TA, Majumdar R. From verification to control: dynamic
programs for omega-regular objectives. In: Proceedings of the 16th Annual IEEE
Symposium on Logic in Computer Science. IEEE; 2001:279-290. doi:10.1109/LICS.2001.932504'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2001). From verification
to control: dynamic programs for omega-regular objectives. In Proceedings of
the 16th Annual IEEE Symposium on Logic in Computer Science (pp. 279–290).
Boston, MA, USA: IEEE. https://doi.org/10.1109/LICS.2001.932504'
chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “From Verification
to Control: Dynamic Programs for Omega-Regular Objectives.” In Proceedings
of the 16th Annual IEEE Symposium on Logic in Computer Science, 279–90. IEEE,
2001. https://doi.org/10.1109/LICS.2001.932504.'
ieee: 'L. De Alfaro, T. A. Henzinger, and R. Majumdar, “From verification to control:
dynamic programs for omega-regular objectives,” in Proceedings of the 16th
Annual IEEE Symposium on Logic in Computer Science, Boston, MA, USA, 2001,
pp. 279–290.'
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. From verification to control:
dynamic programs for omega-regular objectives. Proceedings of the 16th Annual
IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science,
279–290.'
mla: 'De Alfaro, Luca, et al. “From Verification to Control: Dynamic Programs for
Omega-Regular Objectives.” Proceedings of the 16th Annual IEEE Symposium on
Logic in Computer Science, IEEE, 2001, pp. 279–90, doi:10.1109/LICS.2001.932504.'
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 16th Annual
IEEE Symposium on Logic in Computer Science, IEEE, 2001, pp. 279–290.
conference:
end_date: 2001-06-19
location: Boston, MA, USA
name: 'LICS: Logic in Computer Science'
start_date: 2001-06-16
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-07T00:00:00Z
date_updated: 2023-05-08T09:48:06Z
day: '07'
doi: 10.1109/LICS.2001.932504
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 279 - 290
publication: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
publication_identifier:
isbn:
- 076951281X
publication_status: published
publisher: IEEE
publist_id: '72'
quality_controlled: '1'
status: public
title: 'From verification to control: dynamic programs for omega-regular objectives'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...